𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithm Engineering Volume 2141 || Pareto Shortest Paths is Often Feasible in Practice

✍ Scribed by Brodal, Gerth Stølting; Frigioni, Daniele; Marchetti-Spaccamela, Alberto

Book ID
120353764
Publisher
Springer Berlin Heidelberg
Year
2001
Tongue
English
Weight
222 KB
Edition
1
Category
Article
ISBN
3540446885

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe
[Lecture Notes in Computer Science] Experimental and Efficient Algorithms Volume 3503 || Acceleration of Shortest Path and Constrained Shortest Path Computation
✍ Nikoletseas, Sotiris E. 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 236 KB

This Book Constitutes The Refereed Proceedings Of The 4th International Workshop On Experimental And Efficient Algorithms, Wea 2005, Held In Santorini Island, Greece In May 2005. The 47 Revised Full Papers And 7 Revised Short Papers Presented Together With Extended Abstracts Of 3 Invited Talks Were

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithm Engineering and Experiments Volume 2409 || Experimental Evaluation of a New Shortest Path Algorithm
✍ Mount, David M.; Stein, Clifford 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 245 KB

This Book Constitutes The Thoroughly Refereed Post-proceedings Of The 4th International Workshop On Algorithm Engineering And Experiments, Alenex 2002, Held In San Francisico, Ca, Usa In January 2002.the 15 Revised Full Papers Presented Were Carefully Reviewed And Selected From 34 Submissions. Among

[Lecture Notes in Computer Science] Web-
[Lecture Notes in Computer Science] Web-Age Information Management Volume 7418 || Dynamic Graph Shortest Path Algorithm
✍ Gao, Hong; Lim, Lipyeow; Wang, Wei; Li, Chuan; Chen, Lei 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 358 KB

This book constitutes the refereed proceedings of the 13th International Conference on Web-Age Information Management, WAIM 2012, held in Harbin, China in August 2012. The 32 revised full papers presented together with 10 short papers and three keynotes were carefully reviewed and selected from a to

[Lecture Notes in Computer Science] Expe
[Lecture Notes in Computer Science] Experimental Algorithms Volume 6630 || A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
✍ Pardalos, Panos M.; Rebennack, Steffen 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 211 KB

This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 submissio