On the Online Weighted Non-Crossing Matching Problem

Medientyp: Sonstige Veröffentlichung; E-Artikel; Elektronischer Konferenzbericht

Titel: On the Online Weighted Non-Crossing Matching Problem

Beteiligte: Boyar, Joan [Verfasser:in]; Kamali, Shahin [Verfasser:in]; Larsen, Kim S. [Verfasser:in]; Lavasani, Ali Mohammad [Verfasser:in]; Li, Yaqiao [Verfasser:in]; Pankratov, Denis [Verfasser:in]

Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024

Sprache: Englisch

DOI: https://doi.org/10.4230/LIPIcs.SWAT.2024.16

Schlagwörter: non-crossing constraints ; competitive analysis ; online algorithms with advice ; weighted matching problem ; randomized online algorithms ; Euclidean plane ; online algorithms with revoking ; Online algorithms

Entstehung:

Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.

Beschreibung: 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.

Zugangsstatus: Freier Zugang

Nur in Feld suchen:

Zuletzt gesuchte Begriffe: