Cover Image
Read Now

Approximation and Online Algorithms First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers

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 o...

Full description

Bibliographic Details
Other Authors: Jansen, Klaus (Editor), Solis-Oba, Roberto (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2004, 2004
Edition:1st ed. 2004
Series:Lecture Notes in Computer Science
Subjects:
Artificial Intelligence / Data Processing
Computer Graphics
Software Engineering
Computer Science / Mathematics
Numerical Analysis
Discrete Mathematics In Computer Science
Algorithms
Discrete Mathematics
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 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

Similar Items