LP-based algorithms for multistage minimization problems
From MaRDI portal
Publication:2117680
DOI10.1007/978-3-030-80879-2_1OpenAlexW3183892126MaRDI QIDQ2117680FDOQ2117680
Evripidis Bampis, Alexander Kononov, Bruno Escoffier
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/1909.10354
Cites Work
- The Design of Approximation Algorithms
- The prize collecting traveling salesman problem
- A General Approximation Technique for Constrained Forest Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Multistage Vertex Cover
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- A note on the prize collecting traveling salesman problem
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- Offline and online facility leasing
- Heuristic analysis, linear programming and branch and bound
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- Reallocating multiple facilities on the line
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Title not available (Why is that?)
- Title not available (Why is that?)
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- The power of recourse for online MST and TSP
- The Itinerant List Update problem
- Competitive Analysis via Regularization
- Online multistage subset maximization problems
- Unified algorithms for online learning and competitive analysis
- Dynamic Facility Location via Exponential Clocks
Cited In (5)
This page was built for publication: LP-based algorithms for multistage minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117680)
