Parameterized approximation algorithms for some location problems in graphs.
Arne LeitertFeodor F. DraganPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- approximation algorithms
- location problems
- undirected graph
- single facility
- np hard
- special case
- worst case
- facility location problem
- vertex cover
- set cover
- approximation ratio
- bicriteria
- open shop
- precedence constraints
- constant factor
- approximation guarantees
- weighted graph
- primal dual
- minimum cost
- randomized algorithms
- directed graph
- disjoint paths
- multiple objectives
- evolutionary algorithm
- combinatorial auctions
- planar graphs