Approximation and online algorithms 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers /

Saved in:
Bibliographic Details
Corporate Authors: WAOA 2006 Zurich, Switzerland, SpringerLink (Online service)
Other Authors: Erlebach, Thomas, Kaklamanis, Christos
Format: Conference Proceeding eBook
Language:English
Published: Berlin ; New York : Springer, ©2006.
Berlin ; New York : [2006]
Series:Lecture notes in computer science ; 4368.
Physical Description:
1 online resource (x, 344 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:
  • Approximation Algorithms for Scheduling Problems with Exact Delays
  • Bidding to the Top: VCG and Equilibria of Position-Based Auctions
  • Coping with Interference: From Maximum Coverage to Planning Cellular Networks
  • Online Dynamic Programming Speedups
  • Covering Many or Few Points with Unit Disks
  • On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
  • Online k-Server Routing Problems
  • Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
  • Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
  • A Randomized Algorithm for Online Unit Clustering
  • On Hierarchical Diameter-Clustering, and the Supplier Problem
  • Bin Packing with Rejection Revisited
  • On Bin Packing with Conflicts
  • Approximate Distance Queries in Disk Graphs
  • Network Design with Edge-Connectivity and Degree Constraints
  • Approximating Maximum Cut with Limited Unbalance
  • Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
  • Improved Online Hypercube Packing
  • Competitive Online Multicommodity Routing
  • The k-Allocation Problem and Its Variants
  • An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions
  • Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
  • Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
  • Approximation Algorithms for Multi-criteria Traveling Salesman Problems
  • The Survival of the Weakest in Networks
  • Online Distributed Object Migration.

Similar Items