Geometric Approximation Algorithms
GPTKB entity
Statements (44)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
gptkb:Facility_Location
Network Design Clustering Geometric Optimization |
| gptkbp:approximationRatio |
Depends on Problem
|
| gptkbp:complexity |
Polynomial Time
|
| gptkbp:conference |
gptkb:FOCS
gptkb:SODA gptkb:STOC SoCG |
| gptkbp:fieldOfStudy |
Theoretical Computer Science
Computational Geometry |
| gptkbp:goal |
Efficient Computation
Find Near-Optimal Solutions Handle NP-hardness |
| https://www.w3.org/2000/01/rdf-schema#label |
Geometric Approximation Algorithms
|
| gptkbp:notableContributor |
gptkb:Sariel_Har-Peled
gptkb:Kurt_Mehlhorn gptkb:Sanjeev_Arora gptkb:David_P._Williamson |
| gptkbp:notablePublication |
Geometric Approximation Algorithms (Har-Peled, 2011)
The Design of Approximation Algorithms (Williamson & Shmoys, 2011) Approximation Schemes for Euclidean TSP and Other Geometric Problems (Arora, 1998) |
| gptkbp:relatedTo |
gptkb:Minimum_Spanning_Tree
gptkb:Set_Cover gptkb:Euclidean_TSP Approximation Algorithms FPTAS Geometric Covering Geometric Hitting Set Geometric Packing NP-hard Problems PTAS k-means Clustering |
| gptkbp:technique |
Random Sampling
Divide and Conquer Greedy Algorithms Local Search Core-Set Construction LP Relaxation Primal-Dual Method |
| gptkbp:bfsParent |
gptkb:Sariel_Har-Peled
|
| gptkbp:bfsLayer |
6
|