On the geometric red-blue set cover problem (Q2232240)
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 7405957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the geometric red-blue set cover problem |
scientific article; zbMATH DE number 7405957 |
Statements
On the geometric red-blue set cover problem (English)
0 references
4 October 2021
0 references
red-blue set cover
0 references
special red-blue set cover
0 references
anchored rectangles
0 references
segments
0 references
polynomial time algorithms
0 references
\( \mathsf{APX} \)-hard
0 references
\( \mathsf{NP} \)-hard
0 references
0 references
0.8860142827033997
0 references
0.8820787072181702
0 references
0.8688991069793701
0 references
0.8449687957763672
0 references
