Abstract
Networks design is often concerned with the problem of finding optimum weighted spanning trees. This work summarizes some recent results about the computational complexity of these problems with the aim of identifying the borderline between “easy” and “hard” problems. Several tree weight functions and side constraints are considered.
Partially supported by an Italian Ministry of Education Research Contract.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ariosto L., Orlando Furioso, XXIV, 2 (1532).
Karp, R.M., Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Pergamon Press, Oxford & N.Y. (1972) 85–103.
Aho, A.V., Hoperoft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass. (1974).
Garey, M.R. and Johnson, D.S., Computers and Intractability, W.H. Freeman & Co., S. Francisco (1979).
Camerini, P.M., Galbiati,G., and Maffioli, F., Complexity of Spanning tree problems: Part I, EJOR (to appear).
Christofides, N., Graph Theory: an Algorithmic Approach,Academic Press,London (1975), Ch. 5.
Dijkstra, E., A note on two problems in connection with graphs, Numerical Mathematics, 1 (1959) 269–271.
Camerini, F.M., The min-max spanning tree problem and some extensions, Inf. Proc. Letters 7 (1978) 10–14.
Camerini, P.M., Galbiati G., and Maffioli F., The complexity of Steiner-like problems, 17th Allerton Conf. on Communication, Control and Computing, October 1979.
Cheriton, D., and Tarjan, R.E., Finding minimum spanning trees, SIAM J. on Computing, 5 (1976) 724–742.
Cook, S.A., The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symp. of Th. of Computing (1971) 151–158.
Johnson, D.S., Lenstra,J.K., and Rinnooy Kan, A.H.G., The complexity of the network design problem, Networks, 8 (1978) 279–285.
Kershenbaum, A., Computing capacitated minimal spanning trees efficiently, Networks, 4 (1974) 299–310.
Lawler, E.L., Matroid intersection algorithms, Mathematical Programming, 9 (1979) 31–56.
Lawler, E.L., Combinatorial Optimization: Networks and Matroids,Holt, Rinehart and Winston, N.Y.,(1976).
Lovâsz, L., The matroid parity problem, Dept. of Combinatorics and Optimization, The University of Waterloo, 1979.
Papadimitriou, C.H., and Yannakakis, M., The complexity of restricted minimum spanning tree problems“, Laboratory for Computer Sc., M.I.T., Cambridge, Mass., 1979.
Prim, R., Shortest connection network and some generalizations“ B.S.T.J., 36 (1957) 1389–1401.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Wien
About this chapter
Cite this chapter
Maffioli, F. (1981). Complexity of Optimum Undirected Tree Problems: A Survey of Recent Results. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2748-3_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81626-4
Online ISBN: 978-3-7091-2748-3
eBook Packages: Springer Book Archive