โ Scribed by Yossi Azar (auth.), Giuseppe Persiano, Roberto Solis-Oba (eds.)
No coin nor oath required. For personal study only.
The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from September 14 to September 16, 2004. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,appr- imation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. We thank all the authors who submitted papers to the workshop and we also kindly thank the local organizers of ALGO 2004.
Front Matter....Pages -
Online Packet Switching....Pages 1-5
Approximation Algorithms for Mixed Fractional Packing and Covering Problems....Pages 6-8
Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k -Trees....Pages 9-22
Online Bin Packing with Resource Augmentation....Pages 23-35
A PTAS for Delay Minimization in Establishing Wireless Conference Calls....Pages 36-47
This Side Up!....Pages 48-60
Approximation Algorithm for Directed Multicuts....Pages 61-67
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria....Pages 68-82
Approximation Algorithms for Spreading Points....Pages 83-96
More Powerful and Simpler Cost-Sharing Methods....Pages 97-110
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints....Pages 111-125
Priority Algorithms for Graph Optimization Problems....Pages 126-139
Pricing Network Edges to Cross a River....Pages 140-153
Submodular Integer Cover and Its Application to Production Planning....Pages 154-166
Stochastic Online Scheduling on Parallel Machines....Pages 167-180
A $\frac{5}{4}$ -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path....Pages 181-196
Order-Preserving Transformations and Greedy-Like Algorithms....Pages 197-210
Off-line Admission Control for Advance Reservations in Star Networks....Pages 211-224
Joint Base Station Scheduling....Pages 225-238
Universal Bufferless Routing....Pages 239-252
Strong Colorings of Hypergraphs....Pages 253-266
Deterministic Monotone Algorithms for Scheduling on Related Machines....Pages 267-280
Better Bounds for Minimizing SONET ADMs....Pages 281-294
Back Matter....Pages -
Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Computer Graphics; Data Structures; Algorithms
๐ SIMILAR VOLUMES
<p>The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental researc
<P>This book constitutes the thoroughly refereed post proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event.</P> <P>The 26 revised full papers presented were carefully
<P>This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event.</P><P>The 26 revised full papers presented were carefully re