Abstract
Given an undirected graph with two different nonnegative costs associated with every edge e (say, w e for the weight and l e for the length of edge e) and a budget L, consider the problem of finding a spanning tree of total edge length at most L and minimum total weight under this restriction. This constrained minimum spanning tree problem is weakly NP-hard. We present a polynomial-time approximation scheme for this problem. This algorithm always produces a spanning tree of total length at most (1 + ε)L and of total weight at most that of any spanning tree of total length at most L, for any fixed ε >0. The algorithm uses Lagrangean relaxation, and exploits adjacency relations for matroids.
Research supported in part by NSF contract 9302476-CCR, ARPA Contract N00014-95-1-1246, and a Sloan fellowship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
V. Aggarwal, Y. Aneja and K. Nair, “Minimal spanning tree subject to a side constraint,” Comput. Operations Res. 9, 287–296 (1982).
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990).
M. Guignard and M.B. Rosenwein, “An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem,” Networks 20, 345–359 (1990).
J.-H. Lin and J.S. Vitter, “ε-approximations with minimum packing constraint violation,” Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 771–782 (1992).
M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, “Bicriteria network design problems,” Proc. of the 22nd ICALP, LNCS 944, 487–498 (1995).
N. Meggido, “Applying parallel computation algorithms in the design of serial algorithms,” Journal of the ACM 30, 852–865 (1983).
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York (1988).
F.P. Preparata, “New parallel-sorting schemes”, IEEE Trans. Corn-put. C-27, 669–673 (1978).
R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, “Many birds with one stone: Multi-objective approximation algorithms,” Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 438–447 (1993).
D.B. Shmoys and E. Tardos, ”Scheduling unrelated parallel machines with costs,” Proc., 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 448–454 (1993).
D.D. Sleator and R.E. Tarjan, “A Data Structure fo Dynamic Trees,” Journal of Computer and System Sciences 26, 362–391 (1983).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravi, R., Goemans, M.X. (1996). The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_121
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_121
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive