Lagrangean bounds for the optimum communication spanning tree problem
- 11 September 2009
- journal article
- research article
- Published by Springer Nature in TOP
- Vol. 18 (1) , 140-157
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Tight bounds from a path based formulation for the tree of hub location problemComputers & Operations Research, 2009
- Algorithms for the optimum communication spanning tree problemAnnals of Operations Research, 2006
- Lagrangean relaxationTOP, 2003
- A polynomial time approximation scheme for the two-source minimum routing cost spanning treesJournal of Algorithms, 2002
- Exact algorithms for minimum routing cost treesNetworks, 2002
- Approximation algorithms for some optimum communication spanning tree problemsDiscrete Applied Mathematics, 2000
- Deterministic polylog approximation for minimum communication spanning trees1998
- The complexity of the network design problemNetworks, 1978
- Optimum Communication Spanning TreesSIAM Journal on Computing, 1974
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957