✦ LIBER ✦

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 7846 || On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods

✍ Scribed by Erlebach, Thomas; Persiano, Giuseppe

Book ID: 120296896
Publisher: Springer Berlin Heidelberg
Year: 2013
Weight: 247 KB
Category: Article
ISBN: 3642380166
DOI: 10.1007/978-3-642-38016-7_9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 7846 || Online Exploration of Polygons with Holes

✍ Erlebach, Thomas; Persiano, Giuseppe 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 257 KB

This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event. The 22 revised full papers presented together with i

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 7846 || Approximation Algorithms for the Wafer to Wafer Integration Problem

✍ Erlebach, Thomas; Persiano, Giuseppe 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 235 KB

[Lecture Notes in Computer Science] Simu

[Lecture Notes in Computer Science] Simulated Evolution and Learning Volume 5361 || Improving NSGA-II Algorithm Based on Minimum Spanning Tree

✍ Li, Xiaodong; Kirley, Michael; Zhang, Mengjie; Green, David; Ciesielski, Vic; Ab 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 491 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 5426 || On the Maximum Edge Coloring Problem

✍ Bampis, Evripidis; Skutella, Martin 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 507 KB

This Book Constitutes The Thoroughly Refereed Post Workshop Proceedings Of The 6th International Workshop On Approximation And Online Algorithms, Waoa 2008, Held In Karlsruhe, Germany, In September 2008 As Part Of The Algo 2008 Conference Event. The 22 Revised Full Papers Presented Were Carefully Re

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || Approximation of polygonal curves with minimum number of line segments

✍ Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashit 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 576 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 71 || The complexity of restricted minimum spanning tree problems

✍ Maurer, Hermann A. 📂 Article 📅 1979 🏛 Springer Berlin Heidelberg ⚖ 459 KB