Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$82.78
Used and New from Other Sellers
Used and New from Other Sellers
from $23.25
Usually ships in 1-2 business days
(Save 78%)
Other sellers (Paperback)
  • All (10) from $23.25   
  • New (4) from $69.70   
  • Used (6) from $23.25   

Overview

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004.

The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

Read More Show Less

Product Details

Table of Contents

Invited Talks.- Online Packet Switching.- Approximation Algorithms for Mixed Fractional Packing and Covering Problems.- Regular Papers.- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees.- Online Bin Packing with Resource Augmentation.- A PTAS for Delay Minimization in Establishing Wireless Conference Calls.- This Side Up!.- Approximation Algorithm for Directed Multicuts.- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.- Approximation Algorithms for Spreading Points.- More Powerful and Simpler Cost-Sharing Methods.- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.- Priority Algorithms for Graph Optimization Problems.- Pricing Network Edges to Cross a River.- Submodular Integer Cover and Its Application to Production Planning.- Shastic Online Scheduling on Parallel Machines.- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.- Order-Preserving Transformations and Greedy-Like Algorithms.- Off-line Admission Control for Advance Reservations in Star Networks.- Joint Base Station Scheduling.- Universal Bufferless Routing.- Strong Colorings of Hypergraphs.- Deterministic Monotone Algorithms for Scheduling on Related Machines.- Better Bounds for Minimizing SONET ADMs.

Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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)