FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees.
Tomás Martínez-MuñozAndreas WiesePublished in: ESA (2021)
Keyphrases
- approximation algorithms
- np hard
- fixed parameter tractable
- special case
- min cost
- vertex cover
- facility location problem
- approximation schemes
- network design problem
- set cover
- worst case
- minimum cost
- exact algorithms
- randomized algorithms
- np hardness
- constant factor
- open shop
- polynomial time approximation
- primal dual
- approximation ratio
- undirected graph
- precedence constraints
- combinatorial auctions
- simulated annealing
- objective function
- scheduling problem
- disjoint paths