Multistage Matchings

@inproceedings{Bampis2018MultistageM,
  title={Multistage Matchings},
  author={E. Bampis and B. Escoffier and M. Lampis and V. Paschos},
  booktitle={SWAT},
  year={2018}
}
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 total cost, while minimizing the number of changes from one instance to the next. Formally, 17 we are given a sequence of edge-weighted graphs on the same set of vertices V , and are asked to 18 produce a perfect matching in each instance so that the total edge cost plus the transition cost 19 (the cost… 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
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 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
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 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
Computing Maximum Matchings in Temporal Graphs
TLDR
This paper introduces and studies the complexity of a natural temporal extension of the classical graph problem Maximum Matching, taking into account the dynamic nature of temporal graphs, and proves strong computational hardness results for Maximum Temporal Matching. Expand
Sliding Window Temporal Graph Coloring
TLDR
A thorough investigation of the computational complexity of this temporal coloring problem is presented, and strong computational hardness results are proved, complemented by efficient exact and approximation algorithms. 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
...
1
2
...

References

SHOWING 1-10 OF 26 REFERENCES
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
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
The power of deferral: maintaining a constant-competitive steiner tree online
TLDR
Showing that these dual radii cannot change too rapidly is the technical heart of the paper, and allows us to give a hard bound on the number of swaps per arrival, while maintaining a constant-competitive tree at all times. Expand
A Theory and Algorithms for Combinatorial Reoptimization
TLDR
A general model for combinatorial reoptimization is developed, encompassing classical objective functions as well as the goal of minimizing the transition cost from one solution to the other, and distinguishes here for the first time between classes of re Optimization problems, by their hardness status with respect to minimizing transition costs while guaranteeing a good approximation for the underlying optimization problem. 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
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete
  • V. Kann
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • 1991
TLDR
It is proved that maximum 3-dimensional matching is a MAX SNP-hard problem if the number of occurrences of elements in triples is bounded by a constant, and that maximum covering by 3-sets and maximum covering of a graph by triangles are MAX SNP hard. Expand
Offline and online facility leasing
TLDR
This work modifications an O ( log n ) -competitive algorithm of Fotakis (2007) for the online facility location problem and reanalyzes his algorithm via the dual-fitting technique to prove that it achieves the O (log n ) competitive ratio. Expand
Some simplified NP-complete problems
TLDR
This paper shows that a number of NP-complete problems remain NP- complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP-complete. Expand
Dynamic Sum-Radii Clustering
TLDR
An asymptotically optimal Θ(ln n)-approximation algorithm is obtained where n is the number of clients and it is shown that existing algorithms do not achieve a constant approximation in the metric variant of this setting. Expand
...
1
2
3
...