We study online matching in the Euclidean $2$-dimesional plane with non-crossing constraint. The offline version was introduced by Atallah in 1985 and the online version was introduced and studied more recently by Bose et al. The input to the problem consists of a sequence of points, and upon arrival of a point an algorithm can match it with a previously unmatched point provided that line segments corresponding to the matched edges do not intersect. The decisions are irrevocable, and while an optimal offline solution always matches all the points, an online algorithm cannot match all the points in the worst case, unless it is given some side information, i.e., advice. We study two versions of this problem -- monomchromatic (MNM) and bichromatic (BNM). We show that advice complexity of solving BNM optimally on a circle (or, more generally, on inputs in a convex position) is tightly bounded by the logarithm of the $n^\text{th}$ Catalan number from above and below. This result corrects the previous claim of Bose et al. that the advice complexity is $\log(n!)$. At the heart of the result is a connection between non-crossing constraint in online inputs and $231$-avoiding property of permutations of $n$ elements We also show a lower bound of $n/3-1$ and an upper bound of $3n$ on the advice complexity for MNM on a plane. This gives an exponential improvement over the previously best known lower bound and an improvement in the constant of the leading term in the upper bound. In addition, we establish a lower bound of $\frac{\alpha}{2}\infdiv{\frac{2(1-\alpha)}{\alpha}}{1/4}n$ on the advice complexity for achieving competitive ratio $\alpha$ for MNM on a circle. Standard tools from advice complexity, such as partition trees and reductions from string guessing problem, do not seem to apply to MNM/BNM, so we have to design our lower bounds from first principles.
翻译:我们研究在线上匹配 Euclidean $2 dimemental 平面 $2 $2 与非交叉限制 。 Atallah 于 1985 推出离线版本, 而在线版本最近由 Bose 等人 推出和研究 。 问题的输入由一系列点组成, 当一个点到达时, 一个算法可以匹配一个先前不匹配的点 。 与匹配边缘相对的线段不会交叉 。 决定是不可撤销的, 虽然最佳离线解决方案总是符合所有点, 而在最坏的情况中, 在线算法无法满足所有点 。 除非提供一些侧边信息, 即 直线版本最近推出并最近Bose 4 。 我们研究这一问题的两个版本, 单色调( MNMM) 和双色调的分数 。 我们的 Renty- 平面 Rentral 的对 Rentral {th} 和以下已知的调调调调调调调调调调调 。 这可以校正Bose etal etal deal deal deal deal deal deal deal deal deal dal a pal a pal deal deal deal deal deal deal deal deal deal ex ex ex ex ex ex ex ex a put ex ex ex ex a pal deal ex ex ex ex ex ex ex ex ex ex ad a a ex ex ex ex ex ex ex ex ex a a a a pal deal deal ex ex ex ex ex ex ex ex ex ex ex ex exal a a a a a a a a a a a a a pal deal deal deal deal deal deal deal deal deal deal deal deal dealmentalmental dealmental deal ex ex exmental a pal a pal dal deal deal deal exmentm exmental de exm ad a pal de exmal a pal ex ex ex ex ex a pal a ex