Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

Parallel Computing

Volumn 22, Issue 3, 1996, Pages 369-382

  Boldon, Bruce ^a   Deo, Narsingh ^a   Kumar, Nishit ^a  

^a University of Central Florida   (United States)

Author keywords

Constrained problems; Heuristics; Minimum spanning tree; NP complete; SIMD machines

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ELECTRIC WIRING; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); VLSI CIRCUITS;

CONSTRAINED PROBLEMS; MINIMUM SPANNING TREE; RANDOM GRAPHS; SIMD PARALLEL MACHINE;

PARALLEL PROCESSING SYSTEMS;

EID: 0030103806     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(95)00010-0     Document Type: Article

References (30)

1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993) Ch. 13.
2. B. Boldon, N. Deo and N. Kumar, Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine, Technical Report, Dept. of Comp. Science, Univ. of Central Florida, Orlando, CS-TR-95-02, Jan. 1995.
3. P.M. Camerini, G. Galbiati and F. Maffioli. Complexity of spanning tree problems: Part I, Eur. J. Oper. Res. 5 (1980) 346-352.
4. P.M. Camerini, G. Galbiati and F. Maffioli, On the complexity of finding multi-constrained spanning trees, Disc. Appl. Math. 5 (1983) 39-50.
5. P.M. Camerini, G. Galbiati and F. Maffioli, The complexity of weighted constrained spanning trees, in: Proc. Colloq. on the Theory of Algorithms, Pécs 1984 (1984) (Janos Bolyai Mathematical Society, Budapest 1984).
6. T.H. Cormen, CE. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, 1993) Ch. 37.
7. S.K. Das and C.Q. Yang, Performance of parallel spanning tree algorithms on linear array of transputers and Unix systems, Par. Comput. 17 (July 1991) 527-551.
8. DECmpp User's Guide (Programming Language, System Overview) (1992).
9. N. Deo and S.L. Hakimi, The shortest generalized Hamiltonian tree, in Proc. 6th Ann. Allerton Conf. (1968) 879-888.
10. N. Deo and Y.B. Yoo, Parallel algorithms for the minimum spanning tree problem, in Proc. Int. Conf. Par. Process. (Aug. 1980) 243-253.
11. C.N. Fiechter, A. Rogger and D.D. Werra, Basic ideas of tabu search with an application to traveling salesman and quadratic assignment, Ricerca Operativa 62 (1992) 5-28.
12. M. Fürer and B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal, Proc. 3rd Ann. ACM-SIAM SODA (1992) 317-324.
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (W.H. Freeman, San Francisco, 1979).
14. F. Glover, D. Klingman and R. Krishnan, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Eur. J. Oper. Res. 56(3) (1992) 343-353.
15. R.L. Graham and P. Hell, On the history of minimum spanning tree problem Annals Hist. Comput. 7(1) (1985) 43-57.
16. T.S. Hsu and V. Ramachandran, Efficient implementation of virtual processing for some combinatorial algorithms on the MasPar MP-1, in Proc. 7th IEEE Symp. Par. Dist. Process., San Antonio (Oct. 1995).
17. T.S. Hsu, V. Ramachandran and N. Dean, Implementation of parallel graph algorithms on MasPar, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15 (1994) 165-198. Computational Support for Discrete Mathematics, DIMACS Workshop, March 12-14, 1992.
18. D.W. Jones, An empirical comparision of priority-queue and event-set implementations, Comm. ACM 29 (1986) 300-311.
19. S. Khuller, B. Raghavchari and N. Young, Low degree spanning tree of small weights, Proc. 26th Ann. ACM STOCS (1994) 412-421 (to appear in SIAM J. Comput.).
20. M. Krishnamoorthy, A. Suess, M. Onghena, F. Oxaal and T. Spencer, Improvements to Graph-Pack: A system to manipulate graphs and digraphs, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15 (1994) 279-296. Computational Support for Discrete Mathematics, DIMACS Workshop, March 12-14, 1992.
21. F. Malucelli, Quadratic assignement problems: Solutions methods and applications, Ph.D. Dissertation, Dipartmento di Informatica, Università di Pisa, 1993.
22. B.M.E. Moret and H.D. Shapiro, On minimizing a set of tests, SIAM J. Sci. Stat. Comput. 6(4) (1985) 983-1003.
23. B.M.E. Moret and H.D. Shapiro, An empirical analysis of algorithms for constructing minimum spanning tree, LNCS 519 (1991) 400-411.
24. B.M.E. Moret and H.D. Shapiro, How to construct a minimum spanning tree in practice, LNCS 555 (1991) 192-203.
25. B.M.E. Moret and H.D. Shapiro, An empirical assessment of algorithms for constructing a minimum spanning tree, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15 (1994) 99-117. Computational Support for Discrete Mathematics, DIMACS Workshop, March 12-14, 1992.
26. C.H. Papadimitriou and U.V. Vazirani, On two geometric problems related to traveling salesman problem, J. Alg. 5 (1984) 231-246.
27. 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, Proc. 25th Ann. ACM STOCS (1993) 438-447.
28. G. Reinelt, TSPLIB - A Traveling Salesman Problem library, ORSA J. Comput., 2(4) (1991) 376-389.
29. D.J. Rosenkrantz, R.E. Stearns and P.M. Lewis II, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput. 6(3) (1977) 563-581.
30. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2 (1990).