Improved approximation algorithms for the Max Edge-Coloring problem.
Giorgio LucarelliIoannis MilisPublished in: Inf. Process. Lett. (2011)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- exact algorithms
- set cover
- facility location problem
- approximation ratio
- network design problem
- primal dual
- np hardness
- open shop
- combinatorial auctions
- randomized algorithms
- edge detection
- constant factor approximation
- precedence constraints
- constant factor
- approximation schemes
- upper bound