✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms - ESA 2000 Volume 1879 || Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points

✍ Scribed by Paterson, Mike S.

Book ID: 121183654
Publisher: Springer Berlin Heidelberg
Year: 2000
Tongue: English
Weight: 229 KB
Edition: 1
Category: Article
ISBN: 3540452532
DOI: 10.1007/3-540-45253-2_29

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.

📜 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] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1998 Volume 1450 || A parallelization of Dijkstra's shortest path algorithm

✍ Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 673 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel and Distributed Processing and Applications Volume 4330 || On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer

✍ Guo, Minyi; Yang, Laurence T.; Di Martino, Beniamino; Zima, Hans P.; Dongarra, J 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 531 KB

[Lecture Notes in Computer Science] A Co

[Lecture Notes in Computer Science] A Collection of Test Problems for Constrained Global Optimization Algorithms Volume 455 || Distillation column sequencing test problems

✍ Floudas, Christodoulos A.; Pardalos, Panos M. 📂 Article 📅 1990 🏛 Springer Berlin Heidelberg ⚖ 508 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Analysis of Images and Patterns Volume 2756 || A Simple and Efficient Algorithm for Detection of High Curvature Points in Planar Curves

✍ Petkov, Nicolai; Westenberg, Michel A. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 291 KB