✦ LIBER ✦

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6196 || Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

✍ Scribed by Thai, My T.; Sahni, Sartaj

Book ID: 118265634
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 161 KB
Category: Article
ISBN: 3642140319
DOI: 10.1007/978-3-642-14031-0_13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Dist

[Lecture Notes in Computer Science] Distributed Computing Volume 5805 || A Local 2-Approximation Algorithm for the Vertex Cover Problem

✍ Keidar, Idit 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 325 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 4927 || Covering the Edges of Bipartite Graphs Using K 2,2 Graphs

✍ Kaklamanis, Christos; Skutella, Martin 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 514 KB

[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