𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 762 || Finding shortest non-crossing rectilinear paths in plane regions

✍ Scribed by Ng, K. W.; Raghavan, P.; Balasubramanian, N. V.; Chin, F. Y. L.

Book ID
120477017
Publisher
Springer Berlin Heidelberg
Year
1993
Weight
566 KB
Category
Article
ISBN
3540482334

No coin nor oath required. For personal study only.

πŸ“œ 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] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 7936 || A Fast Algorithm Finding the Shortest Reset Words
✍ Du, Ding-Zhu; Zhang, Guochuan πŸ“‚ Article πŸ“… 2013 πŸ› Springer Berlin Heidelberg 🌐 English βš– 284 KB

This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on

[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] Algo
[Lecture Notes in Computer Science] Algorithm Engineering Volume 2141 || Pareto Shortest Paths is Often Feasible in Practice
✍ Brodal, Gerth StΓΈlting; Frigioni, Daniele; Marchetti-Spaccamela, Alberto πŸ“‚ Article πŸ“… 2001 πŸ› Springer Berlin Heidelberg 🌐 English βš– 222 KB

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 t

[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