1. WAOA 2003:
Budapest, Hungary
Klaus Jansen, Roberto Solis-Oba (Eds.):
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers.
Lecture Notes in Computer Science 2909 Springer 2004, ISBN 3-540-21079-2
Contributed Talks
- Udo Adamy, Thomas Erlebach:
Online Coloring of Intervals with Bandwidth.
1-12

- Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks.
13-26

- Spyros Angelopoulos:
Randomized Priority Algorithms: (Extended Abstract).
27-40

- Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in Worst-Case Equilibria.
41-52

- Yossi Azar, Amir Epstein, Leah Epstein:
Load Balancing of Temporary Tasks in the lp Norm.
53-66

- Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Simple On-Line Algorithms for Call Control in Cellular Networks.
67-80

- Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos:
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
81-94

- Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks.
95-108

- Leah Epstein, Arik Ganot:
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
109-122

- Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines.
123-136

- Ari Freund, Dror Rawitz:
Combinatorial Interpretations of Dual Fitting and Primal Fitting.
137-150

- Giulia Galbiati, Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem.
151-164

- Thomas Kamphans, Elmar Langetepe:
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.
165-178

- Elias Koutsoupias, Akash Nanavati:
The Online Matching Problem on a Line.
179-191

- Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to Whack Moles.
192-205

- Jae-Ha Lee:
Online Deadline Scheduling: Team Adversary and Restart.
206-213

- Dániel Marx:
Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).
214-226

- Nicole Megow, Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
227-234

- Deshi Ye, Guochuan Zhang:
On-Line Extensible Bin Packing with Unequal Bin Sizes.
235-247

ARACNE Talks
- Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
248-251

- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Power Consumption Problems in Ad-Hoc Wireless Networks.
252-255

- David Coudert, Hervé Rivano, Xavier Roche:
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.
256-259

- Aleksei V. Fishkin:
Disk Graphs: A Short Survey.
260-264

- Claude Tadonki, Mitali Singh, José D. P. Rolim, Viktor K. Prasanna:
Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems.
265-268

Last update Sat May 25 14:56:58 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page