Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291).
Karthik C. S.Parinya ChalermsookJoachim SpoerhaseMeirav ZehaviMartin HeroldPublished in: Dagstuhl Reports (2023)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- computational complexity
- minimum cost
- exact algorithms
- vertex cover
- np complete
- set cover
- network design problem
- scheduling problem
- primal dual
- integer programming
- randomized algorithms
- undirected graph
- linear programming
- combinatorial auctions
- phase transition
- open shop
- approximation ratio
- constant factor
- approximation schemes
- constant factor approximation
- branch and bound algorithm
- linear program
- lower bound