Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.
Sariel Har-PeledKent QuanrudPublished in: ESA (2015)
Keyphrases
- approximation algorithms
- low density
- undirected graph
- high density
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- approximation guarantees
- facility location problem
- network design problem
- approximation ratio
- randomized algorithms
- primal dual
- np hardness
- disjoint paths
- graph structure
- open shop
- spanning tree
- directed graph
- set cover
- constant factor
- constant factor approximation
- precedence constraints
- graph mining
- lower bound
- weighted graph
- polynomial time approximation
- sensor networks
- scheduling problem
- computational complexity