𝔖 Bobbio Scriptorium

✦ LIBER ✦

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 8591 || Vertex Cover Gets Faster and Harder on Low Degree Graphs

✍ Scribed by Cai, Zhipeng; Zelikovsky, Alex; Bourgeois, Anu

Book ID: 125522296
Publisher: Springer International Publishing
Year: 2014
Tongue: English
Weight: 234 KB
Edition: 2
Category: Article
ISBN: 3319087835
DOI: 10.1007/978-3-319-08783-2_16

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.

📜 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] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 8591 || Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties

✍ Cai, Zhipeng; Zelikovsky, Alex; Bourgeois, Anu 📂 Article 📅 2014 🏛 Springer International Publishing 🌐 English ⚖ 196 KB

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 8591 || Back-Up 2-Center on a Path/Tree/Cycle/Unicycle

✍ Cai, Zhipeng; Zelikovsky, Alex; Bourgeois, Anu 📂 Article 📅 2014 🏛 Springer International Publishing 🌐 English ⚖ 292 KB

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 1627 || On Covering and Rank Problems for Boolean Matrices and Their Applications

✍ Asano, Takano; Imai, Hideki; Lee, D. T.; Nakano, Shin-ichi; Tokuyama, Takeshi 📂 Article 📅 1999 🏛 Springer Berlin Heidelberg ⚖ 154 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 2387 || Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs

✍ Ibarra, Oscar H.; Zhang, Louxin 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 187 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 8447 || On the max min vertex cover Problem

✍ Kaklamanis, Christos; Pruhs, Kirk 📂 Article 📅 2014 🏛 Springer International Publishing 🌐 English ⚖ 254 KB

This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully