Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 263-270

  Gruber, Martin ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bounded diameter minimum spanning tree; Construction heuristics; Dynamic programming; Greedy randomized search; Local improvement

Indexed keywords

BOUNDED DIAMETER; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRUCTION HEURISTICS; CONSTRUCTION PROCESS; EUCLIDEAN INSTANCES; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HIER-ARCHICAL CLUSTERING; IN-NETWORK; META-HEURISTIC APPROACH; METAHEURISTIC; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; NEIGHBORHOOD SEARCH; NP-HARD; RANDOMIZED SEARCH; SOLUTION QUALITY;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GENETIC PROGRAMMING; QUALITY OF SERVICE; SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

HEURISTIC METHODS;

EID: 72749092888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569939     Document Type: Conference Paper

References (18)

1. K. Bala, K. Petropoulos, and T. E. Stern. Multicasting in a linear lightwave network. In Proc. of the 12th IEEE Conference on Computer Communications, pages 1350-1358. IEEE Press, 1993.
2. J. Beasley. OR-Library: Capacitated MST, 2005. http://people.brunel.ac. uk/~mastjjb/jeb/orlib/ capmstinfo.html.
3. J. E. Beasley. A heuristic for Euclidean and rectilinear Steiner problems. European Journal of Operational Research, 58:284-292, 1992.
4. R. E. Bellman. Dynamic Programming. Dover Publications Inc., 2003.
5. A. Bookstein and S. T. Klein. Compression of correlated bit-vectors. Information Systems, 16(4):387-400, 1991.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
7. L. Gouveia and T. L. Magnanti. Network flow models for designing diameter-constrained minimum spanning and Steiner trees. Networks, 41(3):159-173, 2003.
8. L. Gouveia, T. L. Magnanti, and C. Requejo. A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks, 44(4):254-265, 2004.
9. M. Gruber and G. R. Raidl. (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem, 2008. submitted to a special issue on Matheuristics of Operations Research/Computer Science Interface Series, Springer.
10. M. Gruber and G. R. Raidl. Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem. In A. Quesada-Arencibia et al., editors, Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009), pages 228-231, Gran Canaria, Spain, 2009.
11. M. Gruber, J. van Hemert, and G. R. Raidl. Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In M. Keijzer et al., editors, Proc. of the Genetic and Evolutionary Computation Conference 2006, volume 2, pages 1187-1194, 2006.
12. A. Jain, M. Murty, and P.J.Flynn. Data clustering: a review. ACM Computing Surveys (CSUR), 31:264-323, 1999.
13. B. A. Julstrom. Greedy heuristics for the bounded diameter minimum spanning tree problem. Journal of Experimental Algorithmics (JEA), 14:1.1:1-1.1:14, February 2009.
14. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
15. G. R. Raidl and B. A. Julstrom. Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In G. Lamont et al., editors, Proc. of the ACM Symposium on Applied Computing, pages 747-752. ACM Press, 2003.
16. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
17. M. Resende and C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219-249. Kluwer Academic Publishers, 2003.
18. A. Singh and A. K. Gupta. Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 11(10):911-921, 2007.