Red blue set cover problem on axis-parallel hyperplanes and other objects

DOI10.1016/j.ipl.2024.106485MaRDI QIDQ6551707

Pradeesha Ashok, V. P. Abidha

Publication date: 7 June 2024

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

zbMATH Keywords

computational geometryparameterized complexityred-blue set coveraxis-parallel hyperplaneaxis-parallel quadrants

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• An improved algorithm for the red-blue hitting set problem with the consecutive ones property
• An efficient fixed-parameter algorithm for 3-hitting set
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• On the positive-negative partial set cover problem
• Red-blue covering problems and the consecutive ones property
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
• On the geometric red-blue set cover problem
• Geometric red-blue set cover for unit squares and related problems
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• Parameterized Algorithms
• A constant-factor approximation algorithm for red-blue set cover with unit disks

This page was built for publication: Red blue set cover problem on axis-parallel hyperplanes and other objects