Improved Approximation Algorithms for the Max-Edge Coloring Problem.
Giorgio LucarelliIoannis MilisPublished in: TAPAS (2011)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- np hard
- worst case
- special case
- minimum cost
- vertex cover
- exact algorithms
- set cover
- approximation ratio
- primal dual
- facility location problem
- edge detection
- network design problem
- randomized algorithms
- combinatorial auctions
- open shop
- constant factor approximation
- directed graph
- constant factor
- np hardness
- knapsack problem
- polynomial time approximation
- precedence constraints
- learning algorithm
- weighted graph
- spanning tree