Approximation Algorithms for the Mixed Postman Problem.
Balaji RaghavachariJeyakesavan VeerasamyPublished in: IPCO (1998)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- facility location problem
- exact algorithms
- open shop
- approximation ratio
- set cover
- np hardness
- approximation schemes
- precedence constraints
- primal dual
- minimum cost
- network design problem
- constant factor
- constant factor approximation
- integer programming
- disjoint paths