Abstract is missing.
- Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery AlgorithmsSander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys. 1-15 [doi]
- Improved Online Scheduling with Restarts on a Single MachineAflatoun Amouzandeh, Rob van Stee. 16-30 [doi]
- Searching in Euclidean Spaces with PredictionsSergio Cabello, Panos Giannopoulos. 31-45 [doi]
- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-PathsRajesh Chitnis, Samuel Thomas, Anthony Wirth. 46-60 [doi]
- Approximating δ-CoveringTim A. Hartmann, Tom Janßen. 61-75 [doi]
- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect MatchingStefan Hougardy, Karolina Tammemaa. 76-88 [doi]
- Approximation Algorithms for k-Scenario MatchingDanny Blom, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Bart Smeulders. 89-103 [doi]
- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in TreesSvein Høgemo. 104-118 [doi]
- Online Deterministic Minimum Cost Bipartite Matching with Delays on a LineTung-Wei Kuo. 119-134 [doi]
- Maximizing Throughput for Parallel Jobs with Speed-Up CurvesKefu Lu, Mason Marchetti. 135-150 [doi]
- Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph ConnectivityZeev Nutov. 151-166 [doi]
- Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar GraphsRichard Shapley, David B. Shmoys. 167-182 [doi]
- Complexity of Fixed Order RoutingSteven Miltenburg, Tim Oosterwijk, René Sitters. 183-197 [doi]
- Approximate Min-Sum Subset ConvolutionMihail Stoian. 198-212 [doi]
- Online String Attractors - And Their Relation to the Lempel-Ziv FactorizationPhilip Whittington. 213-227 [doi]