Approximation and Online Algorithms: 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $23.97
Usually ships in 1-2 business days
(Save 78%)
Other sellers (Paperback)
  • All (15) from $23.97   
  • New (10) from $67.50   
  • Used (5) from $23.97   


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.

Read More Show Less

Product Details

Table of 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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)