On the hardness of some geometric optimization problems with rectangles

DOI10.1007/978-3-030-36412-0_34zbMATH Open1435.68351OpenAlexW2992525460MaRDI QIDQ2180172

Supantha Pandit

Publication date: 13 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-36412-0_34

zbMATH Keywords

NP-hardnessanchored rectanglesdiscrete dominating setdiscrete independent setstabbed by a horizontal line

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Some new optimum Golomb rectangles

This page was built for publication: On the hardness of some geometric optimization problems with rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180172)