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...
Сохранить в:
| Главный автор: | |
|---|---|
| Соавтор: | |
| Другие авторы: | |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
2909 |
| Предметы: | |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Approximation and online algorithms, first international workshop, WAOA 2003, Budapest, Hungary, september 16-18, 2003, revised papers, Klaus Jansen, Roberto Solis-Oba (eds.), Berlin, Springer, 2004, 1 vol. (VIII-268 p.), Lecture notes in computer science, 3-540-21079-2 • Approximation and Online Algorithms, Texte imprimé, 9783662186374 |
Оглавление:
- 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.