Greedy heuristics for the bounded diameter minimum spanning tree problem

ACM Journal of Experimental Algorithmics

Volumn 14, Issue , 2009, Pages

  Julstrom, Bryant A ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Bounded diameter minimum spanning tree problem; Diameter; Greedy heuristics; Spanning trees

Indexed keywords

EID: 61949356290     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1498698.1498699     Document Type: Article

References (23)

1. ABDALLA, A., DEO, N., AND GUPTA, P. 2000. Random-tree diameter and the diameter constrained MST. Congressus Numerantium, 144, 161-182.
2. ACHUTHAN, N. R., CACCETTA, L., CACCETTA, P., AND GEELEN, J. P. 1994. Computation methods for the diameter restricted minimum weight spanning tree problem. Australasian Journal of Combinatorics 10, 51-71.
3. ALTHAUS, E., FUNKE, S., HAR-PELED, S., KÖNEMANN, J., RAMOS, E. A., AND SKUTELLA, M. 2005. Approximating k-hop minimum-spanning trees. Operations Research Letters 33, 2, 115-120.
4. BEASLEY, J. E. 1990. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069-1072.
5. DAHL, G. 1997. The 2-hop spanning tree problem. Tech. rep. 250, University of Oslo.
6. DAVIS, L. 1991. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
7. DEO, N. AND ABDALLA, A. 2000. Computing a diameter-constrained minimum spanning tree in parallel. In Algorithms and Complexity, G. Bongiovanni, G. Gambosi, and R. Petreschi, Eds. Number 1767 in LNCS. Springer-Verlag, Berlin, 17-31.
8. DOS SANTOS, A. C., LUCENA, A., AND REBEIRO, C. C. 2004. Solving diameter constrained minimum spanning tree problems in dense graphs. In Experimental and Efficient Algorithms: Proceedings of the 3rd International Workshop, WEA 2004, C. C. Rebeiro and S. L. Martins, Eds. Number 3059 in LNCS. Springer, Berlin, 458-467.
9. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
10. GOUVEIA, L. AND MAGNANTI, T. L. 2003. Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41, 159-173.
11. GRUBER, M. AND RAIDL, G. R. 2005a. A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2nd International Network Optimization Conference. Vol. 1. 178-185. Lisbon.
12. GRUBER, M. AND RAIDL, G. R. 2005b. Variable neighborhood search for the bounded diameter minimum spanning tree problem. In Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, P. Hansen, N. Mladenovic, J. A. M. Pérez, B. M. Batista, and J. M. Moreno-Vega, Eds. Tenerife, Spain.
13. GRUBER, M. AND RAIDL, G. R. 2008. Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2008 Symposium on Applications and the Internet. Turku, Finland.
14. GRUBER, M., VAN HEMERT, J., AND RAIDL, G. R. 2006. Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In Proceedings of the 2006 Genetic and Evolutionary Computation Conference, M. Keijzer et al., Eds. Vol. 2. ACM Press, New York, 1187-1194.
15. HANDLER, G. Y. 1978. Minimax location of a facility in an undirected graph. Transportation Science 7, 287-293.
16. JULSTROM, B. A. AND RAIDL, G. R. 2003. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In 2003 Genetic and Evolutionary Computation Conference Workshop Program, A. Barry, Ed. 2-7. Chicago.
17. KING, R. S. AND JULSTROM, B. 1982. Applied Statistics Using the Computer. Alfred Publishing Company, Sherman Oaks, CA.
18. KOPINITSCH, B. 2006. An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem. M.S. thesis, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
19. PRIM, R. C. 1957. Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389-1401.
20. RAIDL, G. R. AND GRUBER, M. 2008. A Lagrangean relax-and-cut approach for the bounded diameter minimum spanning tree problem. In International Conference on Numerical Analysis and Applied Mathematics 2008. AIP Conference Proceedings, vol. 1048. American Institute of Physics, 446-449.
21. RAIDL, G. R. AND JULSTROM, B. A. 2003. Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In Proceedings of the 2003 ACM Symposium on Applied Computing, G. Lamont, H. Haddad, G. A. Papadopoulos, B. Panda, J. Carroll, R. Stansifer, W. Jones, R. Menezes, and W. Shoaff, Eds. ACM Press, New York, 747-752.
22. SINGH, A. AND GUPTA, A. K. 2007. Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Computing 11, 10, 911-921.
23. SÖRENSEN, K. AND JANSSENS, G. K. 2002. Generating solutions for the 2-hop constrained spanning tree and the simple plant location problem in order of decreasing cost. In Proceedings of the 16th Belgian Conference on Quantitative Methods for Decision Making. Brussels.