Approximation algorithms for hitting subgraphs.
Noah BrüstleTal ElbazHamed HatamiOnur KocerBingchan MaPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- set cover
- exact algorithms
- graph mining
- network design problem
- np hardness
- primal dual
- approximation ratio
- facility location problem
- randomized algorithms
- markov chain
- upper bound
- constant factor
- undirected graph
- dynamic programming
- open shop
- constant factor approximation