Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Independent set of convex polygons: from n^ to 1+ via shrinking |
scientific article; zbMATH DE number 6858534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking |
scientific article; zbMATH DE number 6858534 |
Statements
Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (English)
0 references
11 April 2018
0 references
approximation algorithms
0 references
independent set
0 references
geometric intersection graphs
0 references
PTAS
0 references
shrinking
0 references
resource augmentation
0 references
convex polygons
0 references
0 references
0 references
0 references
0.9973034262657166
0 references
0.8162567615509033
0 references
0.8038249015808105
0 references
0.7963616847991943
0 references
0.7768177390098572
0 references
