Abstract
This paper presents a new approach to solve the NP-complete minimum branch vertices problem (MBV) introduced by Gargano et. al [1]. In spite of being a recently proposed problem in the network optimization literature, there are some heuristics to solve it [3]. The main contribution of this paper consists in a new heuristic based on the iterative refinement approach proposed by Deo and Kumar [2]. The experimental results suggest that this approach is capable of finding solutions that are better than the best known in the literature. In this work, for instance, the proposed heuristic found better solutions for 78% of the instances tested. The heuristic looks very promising for the solution of problems related with constrained spanning trees.
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
Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 355–365. Springer, Heidelberg (2002)
Deo, N., Kumar, N.: Computation of Constrained Spanning Trees: A Unified Approach. In: Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 194–220. Springer, New York (1997)
Cerulli, R., Gentili, M., Iossa, A.: Bounded-Degree Spanning Tree Problems: Models and New Algorithms. Comput. Optim. Appl. 42, 353–370 (2009)
Boldon, B., Deo, N., Kumar, N.: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Technical Report CS-TR-95-02, Department of Computer Science, University of Central Florida, Orlando, FL (1995)
Mao, L.J., Deo, N., Lang, S.D.: A Comparison of Two Parallel Approximate Algorithms for the Degree-Constrained Minimum Spanning Tree Problem. Congressus Numerantium 123, 15–32 (1997)
Abdalla, A., Deo, N., Gupta, P.: Random-Tree Diameter and the Diameter Constrained MST. Congressus Numerantium 144, 161–182 (2000)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 498–509. MIT Press, Cambridge (2001)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, pp. 521–522. Prentice-Hall, Englewood Cliffs (1993)
Klingman, D., Napier, A., Stutz, J.: NETGEN – A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Managent Science 20, 814–821 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva, D.M., Silva, R.M.A., Mateus, G.R., Gonçalves, J.F., Resende, M.G.C., Festa, P. (2011). An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)