𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Fundamentals of Computation Theory Volume 3623 || An Improved Approximation Algorithm for TSP with Distances One and Two

✍ Scribed by Liśkiewicz, Maciej; Reischuk, Rüdiger

Book ID
120548037
Publisher
Springer Berlin Heidelberg
Year
2005
Tongue
German
Weight
235 KB
Category
Article
ISBN
3540318739

No coin nor oath required. For personal study only.

✦ Synopsis

This Volume Is Dedicated To The 15th Symposium On Fundamentals Of Computation Theory Fct 2005, Held In Lubeck, Germany, On August 17–20, 2005.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Theo
[Lecture Notes in Computer Science] Theory and Practice of Algorithms in (Computer) Systems Volume 6595 || An Approximative Criterion for the Potential of Energetic Reasoning
✍ Marchetti-Spaccamela, Alberto; Segal, Michael 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 222 KB

This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and

[Lecture Notes in Computer Science] Adva
[Lecture Notes in Computer Science] Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence Volume 5227 || A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP)
✍ Huang, De-Shuang; Wunsch, Donald C.; Levine, Daniel S.; Jo, Kang-Hyun 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 510 KB

The International Conference On Intelligent Computing (icic) Was Formed To P- Vide An Annual Forum Dedicated To The Emerging And Challenging Topics In Artificial Intelligence, Machine Learning, Bioinformatics, And Computational Biology, Etc. It Aims To Bring Together Researchers And Practitioners Fr

[Lecture Notes in Computer Science] Appr
[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || On Bounded Distance Decoding for General Lattices
✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 534 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers

[Lecture Notes in Computer Science] SOFS
[Lecture Notes in Computer Science] SOFSEM 2008: Theory and Practice of Computer Science Volume 4910 || Algorithmic Problems for Metrics on Permutation Groups
✍ Geffert, Viliam; Karhumäki, Juhani; Bertoni, Alberto; Preneel, Bart; Návrat, Pav 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 511 KB

This Book Constitutes The Refereed Proceedings Of The 34th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2008, Held In Slovakia, In 2008. The 57 Revised Full Papers, Presented Together With 10 Invited Contributions, Were Carefully Reviewed And Selected From 162 Subm