Robust online algorithms for dynamic choosing problems
From MaRDI portal
Publication:2117763
DOI10.1007/978-3-030-80049-9_4OpenAlexW3183133566MaRDI QIDQ2117763FDOQ2117763
Sebastian Berndt, Lukas Johannsen, Klaus Jansen, Kilian Grage, Maria Kosche
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2104.09803
Cites Work
- Fully dynamic bin packing revisited
- Fully-Dynamic Bin Packing with Little Repacking
- Approximation algorithms for knapsack problems with cardinality constraints
- A robust APTAS for the classical bin packing problem
- A survey on combinatorial optimization in dynamic environments
- Approximation algorithms for maximum independent set of pseudo-disks
- The maximum edge-disjoint paths problem in bidirected trees
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Title not available (Why is that?)
- Online and dynamic algorithms for set cover
- Online Scheduling with Bounded Migration
- Robust approximation schemes for cube packing
- Robust algorithms for preemptive scheduling
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- Title not available (Why is that?)
- The State of the Art in Dynamic Graph Algorithms
- The Power of Dynamic Distance Oracles
- Symmetry exploitation for online machine covering with bounded migration
- Online Bin Covering with Limited Migration
- Robust online algorithms for certain dynamic packing problems
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Robust online algorithms for dynamic choosing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117763)
