Computing single source shortest paths using single-objective fitness

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Surender Baswana Indian Institute of Technology Kanpur, Kanpur, India
Somenath Biswas Indian Institute of Technology Kanpur
Benjamin Doerr Max-Planck-Institut für Informatik, Saarbrücken, Germany
Tobias Friedrich International Computer Science Institute, Berkeley, CA, USA
Piyush P. Kurur Indian Institute of Technology Kanpur, Kanpur, India
Frank Neumann Max-Planck-Institut für Informatik, Saarbrücken, Germany
Computing single source shortest paths using single-objective fitness Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 25
· Downloads (cumulative): 133
· Citation Count: 16

Published in:
Cover Image
 
· Proceeding
FOGA '09 Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Pages 59-66
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-414-0 doi>10.1145/1527125.1527134

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