Document

# Maintaining Perfect Matchings at Low Cost

## File

LIPIcs.ICALP.2019.82.pdf
• Filesize: 492 kB
• 14 pages

## Acknowledgements

We thank anonymous reviewers for their helpful feedback.

## Cite As

Jannik Matuschke, Ulrike Schmidt-Kraepelin, and José Verschae. Maintaining Perfect Matchings at Low Cost. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 82:1-82:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ICALP.2019.82

## Abstract

The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution completely. On the other hand, one expects that small changes in the input should incur only small changes on the constructed solutions, measured as the number of modified edges. We introduce a two-stage model where we study the trade-off between quality and robustness of solutions. In the first stage we are given a set of nodes in a metric space and we must compute a perfect matching. In the second stage 2k new nodes appear and we must adapt the solution to a perfect matching for the new instance. We say that an algorithm is (alpha,beta)-robust if the solutions constructed in both stages are alpha-approximate with respect to min-cost perfect matchings, and if the number of edges deleted from the first stage matching is at most beta k. Hence, alpha measures the quality of the algorithm and beta its robustness. In this setting we aim to balance both measures by deriving algorithms for constant alpha and beta. We show that there exists an algorithm that is (3,1)-robust for any metric if one knows the number 2k of arriving nodes in advance. For the case that k is unknown the situation is significantly more involved. We study this setting under the metric on the line and devise a (10,2)-robust algorithm that constructs a solution with a recursive structure that carefully balances cost and redundancy.

## Subject Classification

##### ACM Subject Classification
• Mathematics of computing → Combinatorial algorithms
##### Keywords
• matchings
• robust optimization
• approximation algorithms

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Michael Ball, Lawrence Bodin, and Robert Dial. A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles. Transportation Science, 17:4-31, 1983.
2. Colin E. Bell. Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators. European Journal of Operational Research, 73:443-449, 1994.
3. Aaron Bernstein, Jacob Holm, and Eva Rotenberg. Online Bipartite Matching with Amortized O(log² n) Replacements. In Proceedings of the Twenty-ninth Annual ACM SIAM Symposium on Discrete Algorithms (SODA '18), pages 947-959, 2018.
4. Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, and Henry Lin. Online Bipartite Perfect Matching With Augmentations. In Proceedings of the Twenty-eight IEEE Conference on Computer Communications (INFOCOM '09), pages 1044-1052, 2009.
5. Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
6. U. Derigs and A. Metz. A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints. Operations-Research-Spektrum, 14:91-106, 1992.
7. Mitre Costa Dourado, Dirk Meierling, Lucia D. Penso, Dieter Rautenbach, Fabio Protti, and Aline Ribeiro de Almeida. Robust recoverable perfect matchings. Networks, 66:210-213, 2015.
8. Jack Edmonds. Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, Section B, 69:125-130, 1965.
9. Bernhard Fuchs, Winfried Hochstättler, and Walter Kern. Online Matching on a Line. Theoretical Computer Science, 332:251-264, 2005.
10. A. M. Geoffrion and R. Nauss. Parametric and Postoptimality Analysis in Integer Linear Programming. Management Science, 23:453-466, 1977.
11. Edward F. Grove, Ming-Yang Kao, P. Krishnan, and Jeffrey Scott Vitter. Online perfect matching and mobile computing. In Algorithms and Data Structures (WADS '95), volume 955 of Lecture Notes in Computer Science, pages 194-205. Springer, 1995.
12. A. Gu, A. Gupta, and A. Kumar. The power of deferral: maintaining a constant-competitive Steiner tree online. In Proceedings of the Forty-fifth Annual ACM Symposium on Symposium on Theory of Computing (STOC '13), pages 525-534, 2013.
13. A. Gupta and A. Kumar. Online Steiner Tree with Deletions. In Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '14), pages 455-467, 2014.
14. Anupam Gupta, Amit Kumar, and Cliff Stein. Maintaining Assignments Online: Matching, Scheduling, and Flows. In Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '14), pages 468-479, 2014.
15. Anupam Gupta and Kevin Lewi. The Online Metric Matching Problem for Doubling Metrics. In Proceedings of the Thirty-ninth International Colloquium on Automata, Languages and Programming (ICALP '12), pages 424-435, 2012.
16. Bala Kalyanasundaram and Kirk Pruhs. Online Weighted Matching. Journal of Algorithms, 14:478-488, 1993.
17. Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. An Optimal Algorithm for On-line Bipartite Matching. In Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing (STOC '90), pages 352-358, 1990.
18. Samir Khuller, Stephen G. Mitchell, and Vijay V. Vazirani. On-line Algorithms for Weighted Bipartite Matching and Stable Marriages. Theoretical Computer Science, 127:255-267, 1994.
19. Christian Liebchen, Marco Lübbecke, Rolf Möhring, and Sebastian Stiller. The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications, pages 1-27. Springer Berlin Heidelberg, 2009.
20. Nicole Megow, Martin Skutella, José Verschae, and Andreas Wiese. The power of recourse for online MST and TSP. SIAM Journal on Computing, 45:859-880, 2016.
21. K. Nayyar and S. Raghvendra. An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. In Proceedings of the Fifty-eight Annual IEEE Symposium on Foundations of Computer Science (FOCS '17), pages 505-515, 2017.
22. Snjólfur Ólafsson. Weighted Matching in Chess Tournaments. The Journal of the Operational Research Society, 41:17-24, 1990.
23. William R. Pulleyblank. Edmonds, Matching and the Birth of Polyhedral Combinatorics, pages 181-197. Springer Berlin Heidelberg, 2012.
24. Sharath Raghvendra. A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM '16), volume 60 of Leibniz International Proceedings in Informatics, pages 18:1-18:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.
25. Sharath Raghvendra. Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line, 2018. URL: http://arxiv.org/abs/1803.07206.
26. E. Reingold and R. Tarjan. On a Greedy Heuristic for Complete Matching. SIAM Journal on Computing, 10:676-681, 1981.
X

Feedback for Dagstuhl Publishing