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