Approximation Algorithms for Hitting Subgraphs.
Noah BrüstleTal ElbazHamed HatamiOnur KocerBingchan MaPublished in: IWOCA (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- graph mining
- exact algorithms
- network design problem
- primal dual
- facility location problem
- approximation ratio
- np hardness
- markov chain
- precedence constraints
- set cover
- open shop
- randomized algorithms
- undirected graph
- approximation schemes
- constant factor approximation
- genetic algorithm
- combinatorial auctions
- search space