scientific article; zbMATH DE number 7561666
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2019.22MaRDI QIDQ5092381
Bruno Escoffier, Alexandre Teiller, Evripidis Bampis
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Multistage graph problems on a global budget, Multistage \(s-t\) path: confronting similarity with dissimilarity, A multistage view on 2-satisfiability, Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs, Approximating multistage matching problems, A simple rounding scheme for multistage optimization, Target-based computer-assisted orchestration: complexity and approximation algorithms, LP-based algorithms for multistage minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- The min-up/min-down unit commitment polytope
- A theory and algorithms for combinatorial reoptimization
- Offline and online facility leasing
- Integer programming and combinatorial optimization. 12th international IPCO conference, Ithaca, NY, USA, June 25--27, 2007. Proceedings.
- Unified Algorithms for Online Learning and Competitive Analysis
- Dynamic Sum-Radii Clustering
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On the Tradeoff between Stability and Fit
- Dynamic Facility Location via Exponential Clocks
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Competitive Analysis via Regularization
- The Power of Recourse for Online MST and TSP
