Approximation Algorithms for Maximum Edge Coloring Problem.
Wangsen FengLi'ang ZhangWanling QuHanpin WangPublished in: TAMC (2007)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- np hard
- special case
- minimum cost
- facility location problem
- worst case
- vertex cover
- network design problem
- edge detection
- set cover
- open shop
- approximation ratio
- primal dual
- exact algorithms
- randomized algorithms
- integrality gap
- approximation schemes
- np hardness
- combinatorial auctions
- precedence constraints
- weighted graph
- objective function