Solving a "Hard" problem to approximate an "Easy" one (Q5463433): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1379022 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Henk G. Meijer / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152727633 / rank | |||
Normal rank | |||
Latest revision as of 02:20, 20 March 2024
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
