Monochromatic partitioning of colored points by lines

DOI10.1016/j.ipl.2023.106402OpenAlexW4366526155MaRDI QIDQ6161462

No author found.

Publication date: 5 June 2023

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

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

zbMATH Keywords

coveringcomputational geometryapproximation algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing optimal islands
• On the complexity of polyhedral separability
• The maximum box problem and its application to data analysis
• Almost optimal set covers in finite VC-dimension
• The \textsc{red-blue separation} problem on graphs
• Polynomial Time Algorithms for Bichromatic Problems
• A Greedy Heuristic for the Set-Covering Problem
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• On the Parameterized Complexity of Red-Blue Points Separation

This page was built for publication: Monochromatic partitioning of colored points by lines