Parameterized Approximation Algorithms for some Location Problems in Graphs.
Arne LeitertFeodor F. DraganPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- location problems
- undirected graph
- single facility
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- approximation guarantees
- facility location problem
- primal dual
- approximation ratio
- bicriteria
- randomized algorithms
- open shop
- polynomial time approximation
- graph structure
- directed graph
- constant factor approximation
- constant factor
- set cover
- precedence constraints
- spanning tree
- lower bound