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

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

> Home

Details and statistics

DOI: 10.1007/3-540-44808-X_1

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/FeketeMRT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/FeketeMRT01
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. ALENEX 2001: 1-16

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.