Approximation Algorithms for the Asymmetric Postman Problem.
Balaji RaghavachariJeyakesavan VeerasamyPublished in: SODA (1999)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- open shop
- primal dual
- exact algorithms
- network design problem
- disjoint paths
- approximation schemes
- np hardness
- approximation ratio
- set cover
- constant factor
- randomized algorithms
- polynomial time approximation
- undirected graph
- computational complexity
- combinatorial auctions
- closest string