Multistage Knapsack

@article{Bampis2019MultistageK,
  title={Multistage Knapsack},
  author={E. Bampis and B. Escoffier and Alexandre Teiller},
  journal={ArXiv},
  year={2019},
  volume={abs/1901.11260}
}
Many systems have to be maintained while the underlying constraints, costs and/or profits change over time. Although the state of a system may evolve during time, a non-negligible transition cost is incured for transitioning from one state to another. In order to model such situations, Gupta et al. (ICALP 2014) and Eisenstat et al. (ICALP 2014) introduced a multistage model where the input is a sequence of instances (one for each time step), and the goal is to find a sequence of solutions (one… Expand
LP-based algorithms for multistage minimization problems
TLDR
A new two-threshold rounding scheme, tailored for multistage problems, is introduced and it is shown that this rounding scheme gives a 2$f$-approximation algorithm for the multistages variant of the f-Set Cover problem, where each element belongs to at most f sets. 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
Multistage Robust Combinatorial Optimization via Quantified Integer Programming
TLDR
It is argued that multistage robust combinatorial problems can be seen through the lens of quantified integer programs, where powerful tools to reduce the search tree size have been developed. Expand
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 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
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 Committee Election
TLDR
Two time-dependent multistage models based on simple Plurality voting are introduced and it is proved that being revolutionary seems to be "easier" than being conservative, and that the conservative model remains NP-hard while the revolutionary model becomes polynomial-time solvable. 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
General Knapsack Problems in a Dynamic Setting
TLDR
The Generalized Multistage d-Knapsack problem is considered, a generalization of the multistage variants of the Multiple Knapsacks problem, as well as the d-Dimensional Knapsackproblem, where a PTAS is presented. Expand
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
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
A Theory and Algorithms for Combinatorial Reoptimization
TLDR
A general framework for combinatorial repotimization is developed, encompassing classical objective functions as well as the goal of minimizing the transition cost from one solution to the other, distinguishing here for the first time between classes of reoptimization problems by their hardness status with respect to the objective of minimizing transition costs. Expand
On the Tradeoff between Stability and Fit
TLDR
The main technical contribution is a stable extension of Probability Proportional to Size weighted random sampling, with applications to monitoring and anomaly detection problems and a general framework that applies to top-k, minimum spanning tree, and assignment. Expand
Approximation algorithms for knapsack problems with cardinality constraints
TLDR
The main ideas contained in the PTAS are used to derivePTAS's for the knapsack problem and its multi-dimensional generalization which improve on the previously proposed PTAS's. Expand
Fast Approximation Algorithms for Knapsack Problems
  • E. Lawler
  • Mathematics, Computer Science
  • FOCS
  • 1977
TLDR
These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures. 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
Changing Bases: Multistage Optimization for Matroids and Matchings
TLDR
This paper is motivated by the fact that many systems need to be maintained continually while the underlying costs change over time, and model this as a multistage combinatorial optimization problem where the input is a sequence of cost functions. Expand
Fast approximation algorithms for knapsack problems
  • E. Lawler
  • Mathematics, Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures. Expand
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum. Expand
The Power of Recourse for Online MST and TSP
TLDR
An algorithm is introduced that maintains a nearly optimal tree when given constant amortized budget and a promising proof technique is specified and conjecture a structural property of optimal solutions that would prove a constant competitive ratio with a single recourse action. Expand
...
1
2
3
4
...