Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity |
scientific article |
Statements
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (English)
0 references
16 April 2015
0 references
independent sets
0 references
rectangle selection
0 references
duality gap
0 references
0 references
0 references
