Approximation and Online Algorithms : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers

by Persiano, Giuseppe; Solis-Oba, Roberto

• ISBN13: 9783540245742
• ISBN10: 354024574X
• Format: Paperback
• Copyright: 2005-04-01
• Publisher: Springer Verlag

Summary

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004. The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

Table of Contents

Online packet switching	p. 1
Approximation algorithms for mixed fractional packing and covering problems	p. 6
Minimum sum multicoloring on the edges of planar graphs and partial k-trees	p. 9
Online bin packing with resource augmentation	p. 23
A PTAS for delay minimization in establishing wireless conference calls	p. 36
This side up!	p. 48
Approximation algorithm for directed multicuts	p. 61
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria	p. 68
Approximation algorithms for spreading points	p. 83
More powerful and simpler cost-sharing methods	p. 97
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints	p. 111
Priority algorithms for graph optimization problems	p. 126
Pricing network edges to cross a river	p. 140
Submodular integer cover and its application to production planning	p. 154
Stochastic online scheduling on parallel machines	p. 167
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path	p. 181
Ordering-preserving transformations and greedy-like algorithms	p. 197
Off-line admission control for advance reservations in star networks	p. 211
Joint base station scheduling	p. 225
Universal bufferless routing	p. 239
Strong colorings of hypergraphs	p. 253
Deterministic monotone algorithms for scheduling on related machines	p. 267
Better bounds for minimizing SONET ADMs	p. 281
Table of Contents provided by Blackwell. All Rights Reserved.