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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Thang N. Bui The Pennsylvania State University at Harrisburg, Middletown, PA
Catherine M. Zrncic The Pennsylvania State University at Harrisburg, Middletown, PA
Published in:
· Proceeding
GECCO '06 Proceedings of the 8th annual conference on Genetic and evolutionary computation
Pages 11-18
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-186-4 doi>10.1145/1143997.1144000
An ant-based algorithm for finding degree-constrained minimum spanning tree Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 45
· Downloads (cumulative): 864
· Citation Count: 8


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder