Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.
Sariel Har-PeledKent QuanrudPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- low density
- undirected graph
- high density
- special case
- np hard
- worst case
- minimum cost
- vertex cover
- approximation guarantees
- facility location problem
- primal dual
- set cover
- network design problem
- disjoint paths
- approximation schemes
- precedence constraints
- constant factor
- graph structure
- open shop
- np hardness
- spanning tree
- greedy algorithm
- polynomial time approximation
- directed graph
- lower bound