Approximation and online algorithms third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers /

The third Workshop on Approximation and Online Algorithms (WAOA 2005) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of?elds. WAOA 2005 took place in Palma de Mallorca, Spain, on...

Full description

Saved in:
Bibliographic Details
Corporate Authors: WAOA 2005 Palma de Mallorca, Spain, SpringerLink (Online service)
Other Authors: Erlebach, Thomas, Persiano, Giuseppe
Format: Conference Proceeding eBook
Language:English
Published: Berlin ; New York : Springer-Verlag, ©2006.
Berlin ; New York : [2006]
Series:Lecture notes in computer science ; 3879.
Physical Description:
1 online resource (x, 347 pages) : illustrations.
Subjects:
Online algorithms -- Congresses.
Mathematical optimization -- Congresses.
algoritmen.
algorithms.
computeranalyse.
computer analysis.
computergrafie.
computer graphics.
wiskunde.
mathematics.
computertechnieken.
computer techniques.
computerwetenschappen.
computer sciences.
gegevensstructuren.
data structures.
numerieke methoden.
numerical methods.
Information and Communication Technology (General)
Informatie- en communicatietechnologie (algemeen)
Online Access:SpringerLink - Click here for access
Contents:
  • "Almost Stable" Matchings in the Roommates Problem
  • On the Minimum Load Coloring Problem
  • Improved Approximation Algorithms for MAXNAE-SAT and MAXSAT
  • The Hardness of Network Design for Unsplittable Flow with Selfish Users
  • Improved Approximation Algorithm for Convex Recoloring of Trees
  • Exploiting Locality: Approximating Sorting Buffers
  • Approximate Fair Cost Allocation in Metric Traveling Salesman Games
  • Rounding of Sequences and Matrices, with Applications
  • A Note on Semi-online Machine Covering
  • SONET ADMs Minimization with Divisible Paths
  • The Conference Call Search Problem in Wireless Networks
  • Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents
  • Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
  • A Better-Than-Greedy Algorithm for k-Set Multicover
  • Deterministic Online Optical Call Admission Revisited
  • Scheduling Parallel Jobs with Linear Speedup
  • Online Removable Square Packing
  • The Online Target Date Assignment Problem
  • Approximation and Complexity of k-Splittable Flows
  • On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem
  • Tighter Approximations for Maximum Induced Matchings in Regular Graphs
  • On Approximating Restricted Cycle Covers
  • A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
  • Speed Scaling of Tasks with Precedence Constraints
  • Partial Multicuts in Trees
  • Approximation Schemes for Packing with Item Fragmentation.

Similar Items