Shortest-path feasibility algorithms: An experimental evaluation

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Boris V. Cherkassky Central Economics and Mathematics Institute of the Russian Academy of Sciences
Loukas Georgiadis University of Western Macedonia, Kozani, Greece
Andrew V. Goldberg Microsoft Research, Mountain View, CA
Robert E. Tarjan Princeton University, Princeton, NJ
Renato F. Werneck Microsoft Research, Mountain View, CA
Shortest-path feasibility algorithms: An experimental evaluation Published by ACM 2010 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 88
· Downloads (cumulative): 555
· Citation Count: 1

Published in:
· Journal
Journal of Experimental Algorithmics (JEA) JEA Homepage archive
Volume 14, December 2009
Article No. 7
ACM New York, NY, USA
table of contents doi>10.1145/1498698.1537602

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