Skip to Main content Skip to Navigation
Journal articles

A simple rounding scheme for multistage optimization

Abstract : We consider the multistage framework introduced in (Gupta et al., Eisenstat et al., both in ICALP 2014), where we are given a time horizon and a sequence of instances of a (static) combinatorial optimization problem (one for each time step), and the goal is to find a sequence of solutions (one for each time step) reaching a tradeoff between the quality of the solutions in each time step and the stability/similarity of the solutions in consecutive time steps. We first introduce a novel rounding scheme, tailored for multistage problems, that accounts for the moving cost (or stability revenue) of adjacent solutions. Using this rounding scheme, we propose improved approximation algorithms for the multistage variants of Prize-Collecting Steiner Tree and Prize-Collecting Traveling Salesman problems. Furthermore, we introduce a 2-approximation algorithm for multistage Multi-Cut on trees, and we also show that our general scheme can be extended to maximization problems, by providing a 0.75-approximation algorithm for the multistage variant of MaxSat.
Document type :
Journal articles
Complete list of metadata
Contributor : Equipe HAL Université Paris Cité Connect in order to contact the contributor
Submitted on : Tuesday, January 25, 2022 - 4:41:08 PM
Last modification on : Tuesday, March 15, 2022 - 7:11:37 PM



Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander Kononov, Kim Thang Nguyen. A simple rounding scheme for multistage optimization. Theoretical Computer Science, Elsevier, 2022, ⟨10.1016/j.tcs.2022.01.009⟩. ⟨hal-03542969⟩



Record views