License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2018.7
URN: urn:nbn:de:0030-drops-88338
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8833/
Go to the corresponding LIPIcs Volume Portal


Bampis, Evripidis ; Escoffier, Bruno ; Lampis, Michael ; Paschos, Vangelis Th.

Multistage Matchings

pdf-format:
LIPIcs-SWAT-2018-7.pdf (0.4 MB)


Abstract

We consider a multistage version of the Perfect Matching problem which models the scenario where the costs of edges change over time and we seek to obtain a solution that achieves low total cost, while minimizing the number of changes from one instance to the next. Formally, we are given a sequence of edge-weighted graphs on the same set of vertices V, and are asked to produce a perfect matching in each instance so that the total edge cost plus the transition cost (the cost of exchanging edges), is minimized. This model was introduced by Gupta et al. (ICALP 2014), who posed as an open problem its approximability for bipartite instances. We completely resolve this question by showing that Minimum Multistage Perfect Matching (Min-MPM) does not admit an n^{1-epsilon}-approximation, even on bipartite instances with only two time steps. Motivated by this negative result, we go on to consider two variations of the problem. In Metric Minimum Multistage Perfect Matching problem (Metric-Min-MPM) we are promised that edge weights in each time step satisfy the triangle inequality. We show that this problem admits a 3-approximation when the number of time steps is 2 or 3. On the other hand, we show that even the metric case is APX-hard already for 2 time steps. We then consider the complementary maximization version of the problem, Maximum Multistage Perfect Matching problem (Max-MPM), where we seek to maximize the total profit of all selected edges plus the total number of non-exchanged edges. We show that Max-MPM is also APX-hard, but admits a constant factor approximation algorithm for any number of time steps.

BibTeX - Entry

@InProceedings{bampis_et_al:LIPIcs:2018:8833,
  author =	{Evripidis Bampis and Bruno Escoffier and Michael Lampis and Vangelis Th. Paschos},
  title =	{{Multistage Matchings}},
  booktitle =	{16th Scandinavian Symposium and Workshops on Algorithm  Theory (SWAT 2018)},
  pages =	{7:1--7:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-068-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{101},
  editor =	{David Eppstein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8833},
  URN =		{urn:nbn:de:0030-drops-88338},
  doi =		{10.4230/LIPIcs.SWAT.2018.7},
  annote =	{Keywords: Perfect Matching, Temporal Optimization, Multistage Optimization}
}

Keywords: Perfect Matching, Temporal Optimization, Multistage Optimization
Seminar: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Issue Date: 2018
Date of publication: 30.05.2018


DROPS-Home | Imprint | Privacy Published by LZI