Document Open Access Logo

On the Online Weighted Non-Crossing Matching Problem

Authors Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov

PDF
Thumbnail PDF

File

LIPIcs.SWAT.2024.16.pdf
  • Filesize: 0.78 MB
  • 19 pages

Document Identifiers

Author Details

Joan Boyar
  • Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Shahin Kamali
  • Department of Electrical Engineering and Computer Science, York University, Toronto, Canada
Kim S. Larsen
  • Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Ali Mohammad Lavasani
  • Department of CSSE, Concordia University, Montreal, Canada
Yaqiao Li
  • Department of CSSE, Concordia University, Montreal, Canada
Denis Pankratov
  • Department of CSSE, Concordia University, Montreal, Canada

Funding

The first and third authors were supported in part by the Independent Research Fund Denmark, Natural Sciences, grant DFF-0135-00018B. Other authors were supported by NSERC Canada.

Acknowledgements

The authors thank the anonymous referees for their valuable suggestions.

Cite AsGet BibTex

Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, and Denis Pankratov. On the Online Weighted Non-Crossing Matching Problem. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.16

Abstract

We introduce and study the weighted version of an online matching problem in the Euclidean plane with non-crossing constraints: 2n points with non-negative weights arrive online, and an algorithm can match an arriving point to one of the unmatched previously arrived points. In the vanilla model, the decision on how to match (if at all) a newly arriving point is irrevocable. The goal is to maximize the total weight of matched points under the constraint that straight-line segments corresponding to the edges of the matching do not intersect. The unweighted version of the problem was introduced in the offline setting by Atallah in 1985, and this problem became a subject of study in the online setting with and without advice in several recent papers. We observe that deterministic online algorithms cannot guarantee a non-trivial competitive ratio for the weighted problem. We study various regimes of the problem which permit non-trivial online algorithms. In particular, when weights are restricted to the interval [1, U] we give a deterministic algorithm achieving competitive ratio Ω(2^{-2√{log U}}). We also prove that deterministic online algorithms cannot achieve competitive ratio better than O (2^{-√{log U}}). Interestingly, we establish that randomization alone suffices to achieve competitive ratio 1/3 even when there are no restrictions on the weights. Additionally, if one allows an online algorithm to revoke acceptances, then one can achieve a competitive ratio ≈ 0.2862 deterministically for arbitrary weights. We also establish a lower bound on the competitive ratio of randomized algorithms in the unweighted setting, and improve the best-known bound on advice complexity to achieve a perfect matching.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • Online algorithms
  • weighted matching problem
  • Euclidean plane
  • non-crossing constraints
  • competitive analysis
  • randomized online algorithms
  • online algorithms with advice
  • online algorithms with revoking

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. A Karim Abu-Affash, Paz Carmi, Matthew J Katz, and Yohai Trabelsi. Bottleneck non-crossing matching in the plane. Computational Geometry, 47(3):447-457, 2014. Google Scholar
  2. Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, et al. Compatible geometric matchings. Computational Geometry, 42(6-7):617-626, 2009. Google Scholar
  3. Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Penaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, and David R Wood. Edge-removal and non-crossing configurations in geometric graphs. Discrete Mathematics & Theoretical Computer Science, 12(Graph and Algorithms), 2010. Google Scholar
  4. Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect matchings with crossings. Algorithmica, pages 1-20, 2023. Google Scholar
  5. Noga Alon, Sridhar Rajagopalan, and Subhash Suri. Long non-crossing configurations in the plane. In Proceedings of the ninth annual symposium on Computational geometry, pages 257-263, 1993. Google Scholar
  6. Greg Aloupis, Esther M Arkin, David Bremner, Erik D Demaine, Sándor P Fekete, Bahram Kouhestani, and Joseph SB Mitchell. Matching regions in the plane using non-crossing segments. XVI Spanish Meeting on Computational Geometry, 2015. Google Scholar
  7. Drew Armstrong, Christian Stump, and Hugh Thomas. A uniform bijection between nonnesting and noncrossing partitions. Transactions of the American Mathematical Society, 365(8):4121-4151, 2013. Google Scholar
  8. Mikhail J Atallah. A matching problem in the plane. Journal of Computer and System Sciences, 31(1):63-70, 1985. Google Scholar
  9. Vineet Bafna, S Muthukrishnan, and R Ravi. Computing similarity between rna strings. In Combinatorial Pattern Matching: 6th Annual Symposium, CPM 95 Espoo, Finland, July 5-7, 1995 Proceedings 6, pages 1-16. Springer, 1995. Google Scholar
  10. József Balogh, Boris Pittel, and Gelasio Salazar. Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle. Discrete Mathematics & Theoretical Computer Science, Proceedings, 2005. Google Scholar
  11. Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, and Arezoo Sajadpour. Non-crossing matching of online points. In 32 Canadian Conference on Computational Geometry, 2020. Google Scholar
  12. Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, and Jesper W. Mikkelsen. Online algorithms with advice: a survey. ACM Computing Surveys, 50(32):1-34, 2017. Article No. 19. Google Scholar
  13. William YC Chen, Hillary SW Han, and Christian M Reidys. Random k-noncrossing rna structures. Proceedings of the National Academy of Sciences, 106(52):22061-22066, 2009. Google Scholar
  14. Scott Cohen. Finding color and shape patterns in images. PhD dissertation, Stanford University, 1999. Google Scholar
  15. Adrian Dumitrescu and William Steiger. On a matching problem in the plane. Discrete Mathematics, 211(1-3):183-195, 2000. Google Scholar
  16. Peter Elias. Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory, 21(2):194-203, 1975. Google Scholar
  17. András Gyárfás. Ramsey and turán-type problems for non-crossing subgraphs of bipartite geometric graphs. In Annales Univ. Sci. Budapest, volume 54, pages 47-56, 2011. Google Scholar
  18. Koki Hamada, Shuichi Miyazaki, and Kazuya Okamoto. Strongly stable and maximum weakly stable noncrossing matchings. Algorithmica, 83(9):2678-2696, 2021. Google Scholar
  19. John Hershberger and Subhash Suri. Applications of a semi-dynamic convex hull algorithm. BIT Numerical Mathematics, 32(2):249-267, 1992. Google Scholar
  20. John Hershberger and Subhash Suri. Efficient breakout routing in printed circuit boards. In Workshop on Algorithms and Data Structures, pages 462-471. Springer, 1997. Google Scholar
  21. Shahin Kamali, Pooya Nikbakht, and Arezoo Sajadpour. A randomized algorithm for non-crossing matching of online points. In 34th Canadian Conference on Computational Geometry, pages 198-204, 2022. Google Scholar
  22. Mikio Kano and Jorge Urrutia. Discrete geometry on colored point sets in the plane—a survey. Graphs and Combinatorics, 37(1):1-53, 2021. Google Scholar
  23. Ioannis Mantas, Marko Savić, and Hendrik Schrezenmaier. New variants of perfect non-crossing matchings. Discrete Applied Mathematics, 343:1-14, 2024. Google Scholar
  24. Neeldhara Misra, Harshil Mittal, and Saraswati Nanoti. Diverse non crossing matchings. In 34th Canadian Conference on Computational Geometry, pages 249-256, 2022. Google Scholar
  25. Ali Mohammad Lavasani and Denis Pankratov. Advice complexity of online non-crossing matching. Computational Geometry, 110:101943, 2023. URL: https://doi.org/10.1016/j.comgeo.2022.101943.
  26. János Pach, Natan Rubin, and Gábor Tardos. Planar point sets determine many pairwise crossing segments. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 1158-1166, 2019. Google Scholar
  27. Rebecca Patrias, Oliver Pechenik, and Jessica Striker. A web basis of invariant polynomials from noncrossing partitions. Advances in Mathematics, 408:108603, 2022. Google Scholar
  28. David Rappaport. Tight bounds for visibility matching of f-equal width objects. In Japanese Conference on Discrete and Computational Geometry, pages 246-250. Springer, 2002. Google Scholar
  29. Steven Roman. An Introduction to Catalan Numbers. Compact Textbooks in Mathematics. Brikhäuser, 2015. Google Scholar
  30. Suthee Ruangwises and Toshiya Itoh. Stable noncrossing matchings. In International Workshop on Combinatorial Algorithms, pages 405-416. Springer, 2019. Google Scholar
  31. Arezoo Sajadpour. Non-crossing matching of online points. Master’s thesis, University of Manitoba, 2021. Google Scholar
  32. Toshinori Sakai and Jorge Urrutia. Heavy non-crossing increasing paths and matchings on point sets. In XIV Spanish Meeting on Computational Geometry, pages 209-212, 2011. Google Scholar
  33. David Savitt. Polynomials, meanders, and paths in the lattice of noncrossing partitions. Transactions of the American Mathematical Society, 361(6):3083-3107, 2009. Google Scholar
  34. Alexander A Vladimirov. Non-crossing matchings. Problems of Information Transmission, 49(1):54-57, 2013. Google Scholar
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact