Approximation and Online Algorithms
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings
Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings

Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024.  The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.

Table of Contents:
.- Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms. .- Improved online scheduling with restarts on a single machine. .- Searching in Euclidean Spaces with Predictions. .- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths.. .- Approximating delta-Covering. .- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. .- Approximation Algorithms for k-Scenario Matching. .- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. .- Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. .- Maximizing Throughput for Parallel Jobs with Speed-up Curves. .- Improved approximation algorithms for covering pliable set families and flexible graph connectivity. .- Small additive error for unsplittable multicommodity flow in outerplanar graphs. .- Complexity of Fixed Order Routing. .- Approximate Min-Sum Subset Convolution. .- Online String Attractors.


Best Sellers


Product Details
  • ISBN-13: 9783031813955
  • Publisher: Springer International Publishing AG
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3031813952
  • Publisher Date: 14 Mar 2025
  • Height: 235 mm
  • No of Pages: 229
  • Sub Title: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings
Springer International Publishing AG -
Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!