Approximation algorithms for solving the constrained arc routing problem in mixed graphs.
Honglin DingJianping LiKo-Wei LihPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- quadratic program
- worst case
- minimum cost
- vertex cover
- facility location problem
- strongly np hard
- approximation schemes
- set cover
- np hardness
- approximation guarantees
- approximation ratio
- combinatorial optimization
- network design problem
- constant factor
- constant factor approximation
- precedence constraints
- spanning tree
- graph matching
- open shop
- randomized algorithms
- constraint satisfaction problems