Monochromatic plane matchings in bicolored point set

DOI10.1016/j.ipl.2019.105860zbMath1478.68418OpenAlexW2982189439MaRDI QIDQ2338213

Sujoy Bhore, A. Karim Abu-Affash, Paz Carmi

Publication date: 21 November 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105860

zbMATH Keywords

approximation algorithmsbottleneck matchingplane matchingbicolored point sets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Cites Work

• Bottleneck non-crossing matching in the plane
• On plane spanning trees and cycles of multicolored point sets with few intersections
• Approximating the bottleneck plane perfect matching of a point set
• Matching theory
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• Intersection number of two connected geometric graphs
• Geometric spanning cycles in bichromatic point sets
• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• A Bottleneck Matching Problem with Edge-Crossing Constraints
• Geometry Helps in Matching
• Matching Points with Things
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Monochromatic plane matchings in bicolored point set