Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs.
Francisco Javier Zaragoza MartínezPublished in: NEO (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- primal dual
- network design problem
- np hardness
- exact algorithms
- randomized algorithms
- open shop
- set cover
- constant factor
- precedence constraints
- approximation schemes
- combinatorial auctions
- disjoint paths