Approximation and Online Algorithms

Contributed Talks.- 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 ? p Norm.- Simple On-Line Algorithms for Call Control in Cellular Networks.- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.- A -Approximation Algorithm for Scheduling Identical Malleable Tasks.- 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.- ARACNE Talks.- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.- Power Consumption Problems in Ad-Hoc Wireless Networks.- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.- Disk Graphs: A Short Survey.- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems.