✦ LIBER ✦

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 5426 || On the Maximum Edge Coloring Problem

✍ Scribed by Bampis, Evripidis; Skutella, Martin

Book ID: 115445420
Publisher: Springer Berlin Heidelberg
Year: 2009
Tongue: German
Weight: 507 KB
Category: Article
ISBN: 3540939806
DOI: 10.1007/978-3-540-93980-1_22

No coin nor oath required. For personal study only.

✦ Synopsis

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 Reviewed And Selected From 56 Submissions. The Workshop Covered Areas Such As Algorithmic Game Theory, Approximation Classes, Coloring And Partitioning, Competitive Analysis, Computational Finance, Cuts And Connectivity, Geometric Problems, Inapproximability Results, Mechanism Design, Network Design, Packing And Covering, Paradigms For Design And Analysis Of Approximation And Online Algorithms, Randomization Techniques, Real-world Applications, And Scheduling Problems.

📜 SIMILAR VOLUMES

[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 and Online Algorithms Volume 7164 || A New Perspective on List Update: Probabilistic Locality and Working Set

✍ Solis-Oba, Roberto; Persiano, Giuseppe 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 251 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] 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, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 7408 || On the Coin Weighing Problem with the Presence of Noise

✍ Gupta, Anupam; Jansen, Klaus; Rolim, José; Servedio, Rocco 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 207 KB

[Lecture Notes in Computer Science] Abst

[Lecture Notes in Computer Science] Abstraction, Reformulation and Approximation Volume 3607 || The Multi-depot Periodic Vehicle Routing Problem

✍ Zucker, Jean-Daniel; Saitta, Lorenza 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 164 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6756 || Online Graph Exploration: New Results on Old and New Algorithms

✍ Aceto, Luca; Henzinger, Monika; Sgall, Jiří 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 250 KB

The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C)