Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for ..."

Sándor P. Fekete et al. (2002)

> Home

Details and statistics

DOI: 10.1145/944618.944629

access: closed

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/FeketeMRT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/FeketeMRT02
Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ACM J. Exp. Algorithmics 7: 11 (2002)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.