Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems (Q4801176)
From MaRDI portal
scientific article; zbMATH DE number 1893556
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems |
scientific article; zbMATH DE number 1893556 |
Statements
Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems (English)
0 references
7 April 2003
0 references
