Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6426247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity |
scientific article; zbMATH DE number 6426247 |
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
0.9441582560539246
0 references
0.8225994110107422
0 references
0.8143638372421265
0 references
0.8081986308097839
0 references
0.7920590043067932
0 references
