An ant-based algorithm for finding degree-constrained minimum spanning tree

Thang N. Bui, Catherine M. Zrncic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Scopus citations

Abstract

A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graph is well known to be NP-hard. In this paper we give an Ant-Based algorithm for finding low cost degree-constrained spanning trees. Ants are used to identify a set of candidate edges from which a degree-constrained spanning tree can be constructed. Extensive experimental results show that the algorithm performs very well against other algorithms on a set of 572 problem instances.

Original languageEnglish (US)
Title of host publicationGECCO 2006 - Genetic and Evolutionary Computation Conference
PublisherAssociation for Computing Machinery
Pages11-18
Number of pages8
ISBN (Print)1595931864, 9781595931863
DOIs
StatePublished - Jan 1 2006
Event8th Annual Genetic and Evolutionary Computation Conference 2006 - Seattle, WA, United States
Duration: Jul 8 2006Jul 12 2006

Publication series

NameGECCO 2006 - Genetic and Evolutionary Computation Conference
Volume1

Other

Other8th Annual Genetic and Evolutionary Computation Conference 2006
CountryUnited States
CitySeattle, WA
Period7/8/067/12/06

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'An ant-based algorithm for finding degree-constrained minimum spanning tree'. Together they form a unique fingerprint.

  • Cite this

    Bui, T. N., & Zrncic, C. M. (2006). An ant-based algorithm for finding degree-constrained minimum spanning tree. In GECCO 2006 - Genetic and Evolutionary Computation Conference (pp. 11-18). (GECCO 2006 - Genetic and Evolutionary Computation Conference; Vol. 1). Association for Computing Machinery. https://doi.org/10.1145/1143997.1144000