Obtaining optimal k -cardinality trees fast

doi:10.1145/1498698.1537600

Obtaining optimal k-cardinality trees fast

Full Text:

PDF

Buy this Article

Authors:	Markus Chimani	TU Dortmund, Dortmund, Germany
	Maria Kandyba	TU Dortmund, Dortmund, Germany
	Ivana Ljubić	University of Vienna, Vienna, Austria
	Petra Mutzel	TU Dortmund, Dortmund, Germany

	2010 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 6 · Downloads (12 Months): 57 · Downloads (cumulative): 332 · Citation Count: 3

Published in:

· Journal

Journal of Experimental Algorithmics (JEA) JEA Homepage archive

Volume 14, 2009
Article No. 5
ACM New York, NY, USA
table of contents doi>10.1145/1498698.1537600

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: k-cardinality tree algorithms branch and cut comparison with metaheuristics computations on discrete structures design exact algorithm experimentation graph algorithms network problems performance routing and layout steiner tree theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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