✦ LIBER ✦

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

✍ Scribed by Erlebach, Thomas; Persiano, Giuseppe

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

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] 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] 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] Appr

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

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

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 7164 || Faster and Simpler Approximation of Stable Matchings

✍ Solis-Oba, Roberto; Persiano, Giuseppe 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 233 KB

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also conta

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4627 || Approximation Algorithms and Hardness for Domination with Propagation

✍ Charikar, Moses; Jansen, Klaus; Reingold, Omer; Rolim, José D. P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 647 KB