✦ LIBER ✦

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 5431 || The Planar k-Means Problem is NP-Hard

✍ Scribed by Das, Sandip; Uehara, Ryuhei

Book ID: 120440203
Publisher: Springer Berlin Heidelberg
Year: 2009
Weight: 438 KB
Category: Article
ISBN: 3642002021
DOI: 10.1007/978-3-642-00202-1_24

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 5431 || On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

✍ Das, Sandip; Uehara, Ryuhei 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 481 KB

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 7748 || Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs

✍ Ghosh, Subir Kumar; Tokuyama, Takeshi 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 190 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 3341 || Efficient Algorithms for the Longest Path Problem

✍ Fleischer, Rudolf; Trippen, Gerhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 204 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem

✍ Feige, Uriel 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 107 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem

✍ Feige, Uriel 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 107 KB

This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000.The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The pa

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 6552 || De Bruijn Sequences for the Binary Strings with Maximum Density

✍ Katoh, Naoki; Kumar, Amit 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 183 KB