Approximation and Online Algorithms: 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18–19, 2025, Proceedings

Author:   Jannik Matuschke ,  José Verschae
Publisher:   Springer Nature Switzerland AG
ISBN:  

9783032067050


Pages:   229
Publication Date:   02 October 2025
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $171.57 Quantity:  
Add to Cart

Share |

Approximation and Online Algorithms: 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18–19, 2025, Proceedings


Overview

Full Product Details

Author:   Jannik Matuschke ,  José Verschae
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
ISBN:  

9783032067050


ISBN 10:   3032067057
Pages:   229
Publication Date:   02 October 2025
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

.- Interval-Constrained Bipartite Matching over Time. .- The Online Piercing Set Problem With Recourse. .- Online General Knapsack with Reservation Costs. .- Simple Approximations for General Spanner Problems. .- Hardness of Dynamic Core and Truss Decompositions. .- Controlling Tail Risk in Two-Slope Ski Rental. .- Incremental–Decremental Maximization. .- Robust Scheduling on Uniform Machines. .- Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem. .- Low Recourse Arborescence Forests Under Uniformly Random Arcs. .- On the FirstFit Algorithm for Online Unit-Interval Coloring. .- Buy-at-Bulk Facility Location on Trees. .- Improved Online Sorting. .- Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three. .- Approximation algorithms for graph search problems with imperfect detection.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

OCT_RG_2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List