An approximation algorithm for minimum-cost network design.
Yishay MansourDavid PelegPublished in: Robust Communication Networks: Interconnection and Survivability (1998)
Keyphrases
- network design
- minimum cost
- approximation ratio
- np hard
- spanning tree
- network flow
- approximation algorithms
- linear programming
- search space
- dynamic programming
- worst case
- special case
- minimal cost
- path planning
- similarity measure
- minimum cost flow
- neural network
- network simplex algorithm
- ant colony optimization
- simulated annealing
- computational complexity
- objective function