A simple rounding scheme for multistage optimization
From MaRDI portal
Publication:2077374
DOI10.1016/j.tcs.2022.01.009OpenAlexW4206327237MaRDI QIDQ2077374
Evripidis Bampis, Kim Thang Nguyen, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.009
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- A note on the prize collecting traveling salesman problem
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Algorithms for dynamic NFV workload
- The Itinerant List Update problem
- LP-based algorithms for multistage minimization problems
- Reallocating multiple facilities on the line
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- A multistage view on 2-satisfiability
- The Design of Approximation Algorithms
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- The importance of being biased
- The prize collecting traveling salesman problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- A General Approximation Technique for Constrained Forest Problems
- Dynamic Facility Location via Exponential Clocks
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Some optimal inapproximability results
- Multistage Vertex Cover
- Connectivity and inference problems for temporal networks
- Approximation and Online Algorithms
- Approximating multistage matching problems
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- General Knapsack Problems in a Dynamic Setting
This page was built for publication: A simple rounding scheme for multistage optimization
