Approximation Algorithms for Minimum Span Channel Assignment Problems.
Yuichiro MiyamotoTomomi MatsuiPublished in: AAIM (2006)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- worst case
- special case
- network design problem
- exact algorithms
- vertex cover
- facility location problem
- primal dual
- np hardness
- open shop
- network flow
- set cover
- undirected graph
- randomized algorithms
- approximation schemes
- spanning tree
- approximation ratio
- precedence constraints
- branch and bound algorithm
- convex hull
- linear programming
- constant factor approximation