On the Minimum Cost Range Assignment Problem.
Paz CarmiLilach Chaitman-YerushalmiPublished in: CoRR (2015)
Keyphrases
- minimum cost
- np hard
- network flow problem
- approximation algorithms
- spanning tree
- network flow
- capacity constraints
- network simplex algorithm
- scheduling problem
- minimum cost flow
- undirected graph
- np complete
- integer programming
- edit operations
- network design problem
- optimal solution
- linear program
- linear programming
- special case
- lower bound
- computational complexity