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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Solis-Oba, Roberto (Επιμελητής έκδοσης), Jansen, Klaus (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 2909
• Θέματα: Computer science.; Software engineering.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Software Engineering/Programming and Operating Systems.; Algorithm Analysis and Problem Complexity.; Data Structures.; Numeric Computing.; Discrete Mathematics in Computer Science.; Computer Graphics.

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

Πίνακας περιεχομένων:

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