[Lecture Notes in Computer Science] Experimental Algorithms Volume 6630 || An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6630 || Metaheuristic Optimization: Algorithm Analysis and Open Problems

✍ Pardalos, Panos M.; Rebennack, Steffen 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 238 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

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6630 || Efficient Routing in Road Networks with Turn Costs

✍ Pardalos, Panos M.; Rebennack, Steffen 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 185 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

[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

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 5038 || Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem

✍ McGeoch, Catherine C. 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 281 KB

[Lecture Notes in Computer Science] Effi

[Lecture Notes in Computer Science] Efficient Approximation and Online Algorithms Volume 3484 || Approximation Algorithms for the k-Median Problem

✍ Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 451 KB

[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] Experimental Algorithms Volume 6630 || An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms

✦ Synopsis