LP-based algorithms for multistage minimization problems

@article{Bampis2020LPbasedAF,
  title={LP-based algorithms for multistage minimization problems},
  author={Evripidis Bampis and Bruno Escoffier and Alexander V. Kononov},
  journal={ArXiv},
  year={2020},
  volume={abs/1909.10354}
}
We consider a multistage framework introduced recently where, given a time horizon t=1,2,...,T, the input is a sequence of instances of a (static) combinatorial optimization problem I_1,I_2,...,I_T, (one for each time step), and the goal is to find a sequence of solutions S_1,S_2,...,S_T (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. For several polynomial-time solvable… Expand
6 Citations
A General Approach to Approximate Multistage Subgraph Problems
TLDR
This work presents a framework that provides a (1/ √ 2χ)-approximation algorithm for the 2-stage restriction of an MSP if the similarity of subsequent solutions is measured as the intersection cardinality and said MSP is preficient, i.e., the authors can efficiently find a single-stage solution that prefers some given subset. Expand
Multistage Problems on a Global Budget
TLDR
This work studies the different (time) layers of a temporal graph, and finds that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problemssuch as Matching. Expand
Parameterized Algorithms for Diverse Multistage Problems
TLDR
This work introduces a framework allowing it to prove that a number of diverse multistage problems are fixed-parameter tractable by diversity, namely Perfect Matching, s-t Path, Matroid Independent Set, and Plurality Voting. Expand
Approximating Multistage Matching Problems
TLDR
It is shown that multistage perfect matching problems are NP-hard even in very restricted scenarios, and new approximation algorithms and methods are proposed to transfer results between different problem variants without loosing approximation guarantees. Expand
A Multistage View on 2-Satisfiability
TLDR
It is proved that Multistage 2-SAT is NP-hard even in quite restricted cases and parameterized algorithms for Multistages are presented and proved to be asymptotically optimal. Expand
Multistage s-t Path: Confronting Similarity with Dissimilarity
TLDR
It is proved that dissimilarity allows for fixed-parameter tractability for the parameter solution size, contrasting the W[1]-hardness proof of the corresponding similarity case. Expand

References

SHOWING 1-10 OF 40 REFERENCES
Multistage Knapsack
TLDR
A PTAS is proposed for the Multistage Knapsack problem and it is proved that there is no FPTAS for the problem even in the case where T=2, unless P=NP, and a pseudopolynomial time algorithm is given for the cases where the number of steps is bounded by a fixed constant. Expand
Fair Resource Allocation Over Time
TLDR
The over-time version of the Max-Min Fair Allocation problem is considered, and it is shown that in the off-line setting it is possible to get a polynomial-time algorithm with the same approximation ratio as in the case without restrictions, and that it is not possible to find an online algorithm with bounded competitive ratio. Expand
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
TLDR
(2-epsilon)-approximation algorithms for all three problems of the Steiner tree, traveling salesman, and stroll are presented, connected by a unified technique for improving prize-collecting algorithms that allows us to circumvent the integrality gap barrier. Expand
The Traveling-Salesman Problem and Minimum Spanning Trees
TLDR
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers. Expand
Infrastructure Leasing Problems
TLDR
A general approach to solving a wide class of Steiner Tree leasing problems by showing a close connection between deterministic leasing problems and problems in multistage stochastic optimization. Expand
The Power of Recourse for Online MST and TSP
TLDR
This work introduces an algorithm that maintains a nearly optimal tree when given a constant amortized budget and considers online versions of the minimum spanning tree (MST) problem and the traveling salesman problem (TSP) where recourse is allowed. Expand
Multistage Vertex Cover
TLDR
The goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that two vertex cover sets of every two consecutive layers differ not too much (specified by a given parameter). Expand
Multistage Matchings
14 We consider a multistage version of the Perfect Matching problem which models the 15 scenario where the costs of edges change over time and we seek to obtain a solution that achieves 16 low totalExpand
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
TLDR
A primal-dual algorithm is given that makes only a single swap per step (in addition to adding the edge connecting the new point to the previous ones), and such that the tree's cost is only a constant times the optimal cost. Expand
A general approximation technique for constrained forest problems
TLDR
The first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems are derived. Expand
...
1
2
3
4
...