Approximation and online algorithms : first international workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003 : revised papers

Approximation and Online Algorithms: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003. Revised Papers
Author: Roberto Solis-Oba, Klaus Jansen
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-21079-5
DOI: 10.1007/b95598

Table of Contents:

• Online Coloring of Intervals with Bandwidth
• Open Block Scheduling in Optical Communication Networks
• Randomized Priority Algorithms
• Tradeoffs in Worst-Case Equilibria
• Load Balancing of Temporary Tasks in the ℓ
• Simple On-Line Algorithms for Call Control in Cellular Networks
• Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
• A
• Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
• Scheduling AND/OR-Networks on Identical Parallel Machines
• Combinatorial Interpretations of Dual Fitting and Primal Fitting
• On the Approximability of the Minimum Fundamental Cycle Basis Problem
• The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
• The Online Matching Problem on a Line
• How to Whack Moles
• Online Deadline Scheduling: Team Adversary and Restart
• Minimum Sum Multicoloring on the Edges of Trees
• Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms
• On-Line Extensible Bin Packing with Unequal Bin Sizes
• Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms

Includes bibliographical references and index