✦ LIBER ✦

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

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

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

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

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Undecidability Results for Monoids with Linear-Time Decidable Word Problems

✍ Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Lee, D. T.; Teng, Shang-Hua 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 181 KB

The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taip

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Undecidability Results for Monoids with Linear-Time Decidable Word Problems

✍ Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Lee, D. T.; Teng, Shang-Hua 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 181 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 5426 || A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints

✍ Bampis, Evripidis; Skutella, Martin 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 530 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