An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
Srinivasagopalan SrivathsanCostas BuschS. Sitharama IyengarPublished in: CoRR (2010)
Keyphrases
- spanning tree
- network design problem
- minimum cost
- approximation algorithms
- network flow problem
- network design
- minimum spanning tree
- minimum spanning trees
- branch and bound
- transportation networks
- minimal cost
- mixed integer programming
- mixed integer
- minimum weight
- np hard
- integer programming
- lagrangian relaxation
- valid inequalities
- special case
- undirected graph
- traveling salesman problem
- genetic algorithm
- edge weights
- weighted graph
- worst case