Improved approximation algorithms for minimum AND-circuits problem via k-set cover.
Hiroki MorizumiPublished in: Inf. Process. Lett. (2011)
Keyphrases
- set cover
- approximation algorithms
- minimum cost
- np hard
- constant factor
- greedy heuristics
- special case
- worst case
- vertex cover
- facility location problem
- approximation ratio
- primal dual
- greedy algorithm
- network flow
- approximation schemes
- open shop
- undirected graph
- randomized algorithms
- precedence constraints
- reinforcement learning
- approximation guarantees
- polynomial time approximation
- disjoint paths
- constant factor approximation