Approximating Multistage Matching Problems

  title={Approximating Multistage Matching Problems},
  author={Markus Chimani and Niklas Troost and Tilo Wiedera},
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as possible. More precisely, we aim to maximize the intersections, or minimize the unions between consecutive matchings. We show that these problems are NP-hard even in very restricted scenarios. We propose new approximation algorithms and present methods to… Expand

Figures from this paper

A Multistage View on 2-Satisfiability
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
Parameterized Algorithms for Diverse Multistage Problems
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
General Knapsack Problems in a Dynamic Setting
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
A Faster Parameterized Algorithm for Temporal Matching
An improved algorithm is shown to compute a $\Delta$-temporal matching of maximum size with a running time of $Delta^{O(\nu)}\cdot |\mathcal G|$ and hence provide an exponential speedup in terms of $\Delta$. 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
Ear-decompositions of matching-covered graphs
It is proved that a non-bipartite matching-covered graph contains K4 or K2⊕K3 (the triangular prism). Expand
Changing Bases: Multistage Optimization for Matroids and Matchings
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
Multistage Vertex Cover
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
Online Bipartite Matching in Offline Time
By introducing proper amortization the authors can obtain an incremental algorithm that maintains the maximum size matching in total O(√nm) time, which matches the running time of one of the fastest static maximum matching algorithms that was given by Hopcroft and Karp. Expand
An O(VE) algorithm for ear decompositions of matching-covered graphs
This paper presents an O(nm)-time (deterministic) algorithm for constructing an ear decomposition of a matching-covered graph, improving on the previous best running time of O (nm2), and finding the canonical partition of an elementary graph. Expand
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
An efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications is described, which performs O(log n) work per modification, where n is the number of vertices in the graph. Expand
LP-based algorithms for multistage minimization problems
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
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Finding all maximally-matchable edges in a bipartite graph
  • Tamir Tassa
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2012
The algorithm, apart from being deterministic, improves upon that time complexity for bipartite graphs when m=O(n^r) and r<1.876, and is elementary, conceptually simple, and easy to implement. Expand