rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9783540695134

Approximation and Online Algorithms : 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006

by ;
  • ISBN13:

    9783540695134

  • ISBN10:

    3540695133

  • Format: Paperback
  • Copyright: 2007-02-21
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $109.00 Save up to $89.20
  • Digital
    $42.90*
    Add to Cart

    DURATION
    PRICE
    *To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

Summary

This book constitutes the thoroughly refereed post proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions. Topics addressed by the workshop are algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, randomization techniques, real-world applications, and scheduling problems.

Table of Contents

Approximation algorithms for scheduling problems with exact delaysp. 1
Bidding to the top : VCG and equilibria of position-based auctionsp. 15
Coping with interference : from maximum coverage to planning cellular networksp. 29
Online dynamic programming speedupsp. 43
Covering many or few points with unit disksp. 55
On the minimum corridor connection problem and other generalized geometric problemsp. 69
Online k-server routing problemsp. 83
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problemp. 95
Improved approximation bounds for edge dominating set in dense graphsp. 108
A randomized algorithm for online unit clusteringp. 121
On hierarchical diameter-clustering, and the supplier problemp. 132
Bin packing with rejection revisitedp. 146
On bin packing with conflictsp. 160
Approximate distance queries in disk graphsp. 174
Network design with edge-connectivity and degree constraintsp. 188
Approximating maximum cut with limited unbalancep. 202
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problemsp. 214
Improved online hypercube packingp. 226
Competitive online multicommodity routingp. 240
The k-allocation problem and its variantsp. 253
An experimental study of the misdirection algorithm for combinatorial auctionsp. 265
Reversal distance for strings with duplicates : linear time approximation using hitting setp. 279
Approximating the unweighted k-set cover problem : greedy meets local searchp. 290
Approximation algorithms for multi-criteria traveling salesman problemsp. 302
The survival of the weakest in networksp. 316
Online distributed object migrationp. 330
Table of Contents provided by Blackwell. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program