Robust online algorithms for dynamic choosing problems
From MaRDI portal
Publication:2117763
Recommendations
Cites work
- scientific article; zbMATH DE number 2163021 (Why is no real title available?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- A robust AFPTAS for online bin packing with polynomial migration
- A robust APTAS for the classical bin packing problem
- A survey on combinatorial optimization in dynamic environments
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation algorithms for maximum independent set of pseudo-disks
- Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
- Fully dynamic bin packing revisited
- Fully-dynamic bin packing with little repacking
- Online Bin Covering with Limited Migration
- Online and dynamic algorithms for set cover
- Online scheduling with bounded migration
- Online strip packing with polynomial migration
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Robust algorithms for preemptive scheduling
- Robust approximation schemes for cube packing
- Robust online algorithms for certain dynamic packing problems
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Symmetry exploitation for online machine covering with bounded migration
- The Power of Dynamic Distance Oracles
- The State of the Art in Dynamic Graph Algorithms
- The maximum edge-disjoint paths problem in bidirected trees
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)