Approximation and Online Algorithms: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers (Lecture Notes in Computer Science)

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 research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA. Front Matter....Pages - Online Coloring of Intervals with Bandwidth....Pages 1-12 Open Block Scheduling in Optical Communication Networks....Pages 13-26 Randomized Priority Algorithms....Pages 27-40 Tradeoffs in Worst-Case Equilibria....Pages 41-52 Load Balancing of Temporary Tasks in the l p Norm....Pages 53-66 Simple On-Line Algorithms for Call Control in Cellular Networks....Pages 67-80 Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees....Pages 81-94 A $\frac{5}{4}$ -Approximation Algorithm for Scheduling Identical Malleable Tasks....Pages 95-108 Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation....Pages 109-122 Scheduling AND/OR-Networks on Identical Parallel Machines....Pages 123-136 Combinatorial Interpretations of Dual Fitting and Primal Fitting....Pages 137-150 On the Approximability of the Minimum Fundamental Cycle Basis Problem....Pages 151-164 The Pledge Algorithm Reconsidered under Errors in Sensors and Motion....Pages 165-178 The Online Matching Problem on a Line....Pages 179-191 How to Whack Moles....Pages 192-205 Online Deadline Scheduling: Team Adversary and Restart....Pages 206-213 Minimum Sum Multicoloring on the Edges of Trees....Pages 214-226 Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms....Pages 227-234 On-Line Extensible Bin Packing with Unequal Bin Sizes....Pages 235-247 Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms....Pages 248-251 Power Consumption Problems in Ad-Hoc Wireless Networks....Pages 252-255 A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem....Pages 256-259 Disk Graphs: A Short Survey....Pages 260-264 Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems....Pages 265-268 Back Matter....Pages - 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 research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis, inapproximab- ityresults, randomizationtechniques, approximationclasses, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Approximation and Online Algorithms, WAOA 2003, held in Budapest, Hungary in September 2003.

The 19 revised full papers presented together with 5 invited abstracts of the related ARACNE mini-symposium were carefully selected from 41 submissions during two rounds of reviewing and improvement. Among the topics addressed are competitive analysis, inapproximability results, randomization techniques, approximation classes, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and financial problems.

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Approximation and Online Algorithms, WAOA 2003, held in Budapest, Hungary in September 2003. The 19 revised full papers presented together with 5 invited abstracts of the related ARACNE mini-symposium were carefully selected from 41 submissions during two rounds of reviewing and improvement. Among the topics addressed are competitive analysis, inapproximability results, randomization techniques, approximation classes, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and financial problems Online coloring of intervals is a classical problem whose investigation has led to a number of interesting insights into the power and limitations of online algorithms.