Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems.
Akanksha AgrawalDaniel LokshtanovPranabendu MisraSaket SaurabhMeirav ZehaviPublished in: APPROX-RANDOM (2018)
Keyphrases
- approximation algorithms
- vertex cover
- np hardness
- approximation schemes
- special case
- exact algorithms
- np hard
- randomized algorithms
- network design problem
- facility location problem
- np complete
- worst case
- approximation ratio
- minimum cost
- optimization problems
- precedence constraints
- combinatorial optimization
- weighted sum
- set cover
- quadratic program
- practical solutions
- evolutionary algorithm