✦ LIBER ✦

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

✍ Scribed by Keidar, Idit

Book ID: 118016972
Publisher: Springer Berlin Heidelberg
Year: 2009
Weight: 325 KB
Category: Article
ISBN: 3642043550
DOI: 10.1007/978-3-642-04355-0_21

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

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

✍ Thai, My T.; Sahni, Sartaj 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 161 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6506 || Analysis of an Iterated Local Search Algorithm for Vertex Coloring

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 206 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1075 || A 2 2/3-approximation algorithm for the shortest superstring problem

✍ Hirschberg, Dan; Myers, Gene 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 837 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] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Exact (Exponential) Algorithms for the Dominating Set Problem

✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V

[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