LP-based algorithms for multistage minimization problems
type: Item
instance of: scholarly article
title: LP-based algorithms for multistage minimization problems
DOI: 10.1007/978-3-030-80879-2_1
author: Evripidis Bampis
author: Bruno Escoffier
author: Alexander Kononov
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1909.10354
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7495115
zbMATH Keywords: multistage optimization
zbMATH Keywords: approximation algorithms
zbMATH Keywords: LP-rounding
MaRDI profile type: Publication
OpenAlex ID: W3183892126
cites work: Dynamic Facility Location via Exponential Clocks
cites work: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
cites work: The prize collecting traveling salesman problem
cites work: Q5116470
cites work: Online multistage subset maximization problems
cites work: Q5092381
cites work: A note on the prize collecting traveling salesman problem
cites work: Competitive Analysis via Regularization
cites work: Unified algorithms for online learning and competitive analysis
cites work: Facility Location in Evolving Metrics
cites work: Multistage Vertex Cover
cites work: Reallocating multiple facilities on the line
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
cites work: Changing Bases: Multistage Optimization for Matroids and Matchings
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
cites work: The power of recourse for online MST and TSP
cites work: Offline and online facility leasing
cites work: The Itinerant List Update problem
cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application
cites work: The Design of Approximation Algorithms
cites work: Heuristic analysis, linear programming and branch and bound
description: scientific article; zbMATH DE number 7495115