André Rohe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Walter Tietze

> Home > Persons > André Rohe

Publications

2002
[j2]
- view
  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)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/cs-DS-0212044
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-DS-0212044
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. CoRR cs.DS/0212044 (2002)
2001
[c1]
- view
  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.