Bottleneck non-crossing matching in the plane

A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Yohai Trabelsi

doi:10.1016/j.comgeo.2013.10.005

Bottleneck non-crossing matching in the plane

A. Karim Abu-Affash
, Paz Carmi
, Matthew J. Katz
, Yohai Trabelsi

Research output: Contribution to journal › Article › peer-review

19 Scopus citations

Abstract

Let P be a set of 2n points in the plane, and let ^MC (resp., ^MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P. We study the problem of computing ^MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(^n1.5log0.5n)-time algorithm that computes a non-crossing matching M of P, such that bn(M)≤210×bn(^MNC), where bn(M) is the length of a longest edge in M. An interesting implication of our construction is that bn(^MNC)/bn(^MC)≤210. Finally, we show that when the points of P are in convex position, one can compute ^MNC in O(ⁿ³) time, improving a result in [7].

Original language	English
Pages (from-to)	447-457
Number of pages	11
Journal	Computational Geometry: Theory and Applications
Volume	47
Issue number	3 PART A
DOIs	https://doi.org/10.1016/j.comgeo.2013.10.005
State	Published - 1 Jan 2014

Keywords

Approximation algorithms
Bottleneck matching
NP-hardness
Non-crossing configuration

ASJC Scopus subject areas

Computer Science Applications
Geometry and Topology
Control and Optimization
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/j.comgeo.2013.10.005

Cite this

@article{a9b354e3bb6a4c6480531ee110abb439,

title = "Bottleneck non-crossing matching in the plane",

abstract = "Let P be a set of 2n points in the plane, and let MC (resp., MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P. We study the problem of computing MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(n1.5log0.5n)-time algorithm that computes a non-crossing matching M of P, such that bn(M)≤210{\texttimes}bn(MNC), where bn(M) is the length of a longest edge in M. An interesting implication of our construction is that bn(MNC)/bn(MC)≤210. Finally, we show that when the points of P are in convex position, one can compute MNC in O(n3) time, improving a result in [7].",

keywords = "Approximation algorithms, Bottleneck matching, NP-hardness, Non-crossing configuration",

author = "\{Karim Abu-Affash\}, A. and Paz Carmi and Katz, \{Matthew J.\} and Yohai Trabelsi",

year = "2014",

month = jan,

day = "1",

doi = "10.1016/j.comgeo.2013.10.005",

language = "English",

volume = "47",

pages = "447--457",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier B.V.",

number = "3 PART A",

}

TY - JOUR

T1 - Bottleneck non-crossing matching in the plane

AU - Karim Abu-Affash, A.

AU - Carmi, Paz

AU - Katz, Matthew J.

AU - Trabelsi, Yohai

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Let P be a set of 2n points in the plane, and let MC (resp., MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P. We study the problem of computing MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(n1.5log0.5n)-time algorithm that computes a non-crossing matching M of P, such that bn(M)≤210×bn(MNC), where bn(M) is the length of a longest edge in M. An interesting implication of our construction is that bn(MNC)/bn(MC)≤210. Finally, we show that when the points of P are in convex position, one can compute MNC in O(n3) time, improving a result in [7].

AB - Let P be a set of 2n points in the plane, and let MC (resp., MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P. We study the problem of computing MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(n1.5log0.5n)-time algorithm that computes a non-crossing matching M of P, such that bn(M)≤210×bn(MNC), where bn(M) is the length of a longest edge in M. An interesting implication of our construction is that bn(MNC)/bn(MC)≤210. Finally, we show that when the points of P are in convex position, one can compute MNC in O(n3) time, improving a result in [7].

KW - Approximation algorithms

KW - Bottleneck matching

KW - NP-hardness

KW - Non-crossing configuration

UR - https://www.scopus.com/pages/publications/84888435552

U2 - 10.1016/j.comgeo.2013.10.005

DO - 10.1016/j.comgeo.2013.10.005

M3 - Article

AN - SCOPUS:84888435552

SN - 0925-7721

VL - 47

SP - 447

EP - 457

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 3 PART A

ER -

Bottleneck non-crossing matching in the plane

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this