Approximation and Online Algorithms

6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers

Evripidis Bampis, Martin Skutella (Herausgeber)

Buch | Softcover

X, 293 Seiten

2009 | 2009
Springer Berlin (Verlag)
978-3-540-93979-5 (ISBN)

Infos

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.

Inhalt

WAOA 2008.- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.- Size Versus Stability in the Marriage Problem.- Degree-Constrained Subgraph Problems: Hardness and Approximation Results.- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.- Minimizing Average Flow Time on Unrelated Machines.- Cooperation in Multiorganization Matching.- Randomized Algorithms for Buffer Management with 2-Bounded Delay.- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.- Malicious Bayesian Congestion Games.- Stackelberg Strategies and Collusion in Network Games with Splittable Flow.- Peak Shaving through Resource Buffering.- On Lagrangian Relaxation and Subset Selection Problems.- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.- Caching Content under Digital Rights Management.- Reoptimization of Weighted Graph and Covering Problems.- Smoothing Imprecise 1.5D Terrains.- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.- Dynamic Offline Conflict-Free Coloring for Unit Disks.- Experimental Analysis of Scheduling Algorithms for Aggregated Links.- A Approximation Algorithm for the Minimum Maximal Matching Problem.- On the Maximum Edge Coloring Problem.

Produkt-Details

• Erscheint lt. Verlag: 2.2.2009
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Zusatzinfo: X, 293 p.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 462 g
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Schlagworte: Algorithm Analysis • Algorithm analysis and problem complexity • Algorithm design • algorithmic game theory • Algorithmics • algorithms • Approximation • approximation algorithms • assignment problem • combinatorial optimization • competitive analysis • Complexity • constrained maximization • Cooperation • data structures • Discrete Mathematics • distributed algorithms • exact algorithms • Game Theory • geometric algorithms • Graph Algorithms • Hardcover, Softcover / Informatik, EDV/Informatik • monotone algorithms • network design • online algorithms • Partition • precedence constraints • randomized algorithms • Scheduling • selfish routing • set cover • subset selection
• ISBN-10: 3-540-93979-2 / 3540939792
• ISBN-13: 978-3-540-93979-5 / 9783540939795
• Zustand: Neuware