✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithm Theory – SWAT 2012 Volume 7357 || A Simple Framework for the Generalized Nearest Neighbor Problem

✍ Scribed by Fomin, Fedor V.; Kaski, Petteri

Book ID: 121304737
Publisher: Springer Berlin Heidelberg
Year: 2012
Weight: 230 KB
Category: Article
ISBN: 3642311555
DOI: 10.1007/978-3-642-31155-0_8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory – SWAT 2012 Volume 7357 || Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths

✍ Fomin, Fedor V.; Kaski, Petteri 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 216 KB

[Lecture Notes in Computer Science] Hybr

[Lecture Notes in Computer Science] Hybrid Artificial Intelligence Systems Volume 6077 || A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem

✍ Corchado, Emilio; Graña Romay, Manuel; Manhaes Savio, Alexandre 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 156 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel Algorithms for Irregularly Structured Problems Volume 1117 || A simple parallel algorithm for the single-source shortest path problem on planar digraphs

✍ Ferreira, Alfonso; Rolim, José; Saad, Yousef; Yang, Tao 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 770 KB

[Lecture Notes in Computer Science] Netw

[Lecture Notes in Computer Science] Network Optimization Volume 6701 || A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking

✍ Pahl, Julia; Reiners, Torsten; Voß, Stefan 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 264 KB

This Book Constitutes The Refereed Proceedings Of The 5th International Conference On Network Optimization, Inoc 2011, Held In Hamburg, Germany, In June 2011. The 65 Revised Full Papers Presented Were Carefully Reviewed And Selected From Numerous Submissions. The Papers Highlight Recent Developments

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Aided Systems Theory – EUROCAST 2011 Volume 6927 || A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

✍ Moreno-Díaz, Roberto; Pichler, Franz; Quesada-Arencibia, Alexis 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 176 KB

[Lecture Notes in Computer Science] Prac

[Lecture Notes in Computer Science] Practice and Theory of Automated Timetabling V Volume 3616 || A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem

✍ Burke, Edmund; Trick, Michael 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 308 KB