Solving a "Hard" problem to approximate an "Easy" one (Q5463433)
From MaRDI portal
scientific article; zbMATH DE number 2192063
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a "Hard" problem to approximate an "Easy" one |
scientific article; zbMATH DE number 2192063 |
Statements
Solving a "Hard" problem to approximate an "Easy" one (English)
0 references
4 August 2005
0 references
geometric problems
0 references
Fermat-Weber problem
0 references
maximum Traveling Salesman Problem (MTSP)
0 references
maximum weighted matching
0 references
near-linear algorithms
0 references
