Approximation algorithms for the minimum rainbow subgraph problem.
Stephan Matos CamachoIngo SchiermeyerZsolt TuzaPublished in: Discret. Math. (2010)
Keyphrases
- approximation algorithms
- np hard
- minimum cost
- constant factor
- special case
- vertex cover
- worst case
- facility location problem
- primal dual
- approximation ratio
- network flow
- network design problem
- set cover
- scheduling problem
- lower bound
- open shop
- np hardness
- exact algorithms
- precedence constraints
- branch and bound algorithm
- linear programming
- optimal solution
- polynomial time approximation
- approximation schemes
- upper bound
- undirected graph
- randomized algorithms
- approximation guarantees
- search space
- disjoint paths