Minimum vertex cover in rectangle graphs (Q551504)
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 5929156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum vertex cover in rectangle graphs |
scientific article; zbMATH DE number 5929156 |
Statements
Minimum vertex cover in rectangle graphs (English)
0 references
20 July 2011
0 references
approximation algorithms
0 references
axis-parallel rectangles
0 references
intersection graphs
0 references
arrangement graphs
0 references
pseudo-disks
0 references
0 references
0 references
0.9985397458076476
0 references
0.7901050448417664
0 references
0.7864157557487488
0 references
0.785350501537323
0 references
