Approximating maximum diameter-bounded subgraph in unit disk graphs (Q5115768)
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: Approximating maximum diameter-bounded subgraph in unit disk graphs |
scientific article; zbMATH DE number 7236406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating maximum diameter-bounded subgraph in unit disk graphs |
scientific article; zbMATH DE number 7236406 |
Statements
18 August 2020
0 references
approximation algorithms
0 references
maximum diameter-bounded subgraph
0 references
unit disk graphs
0 references
fractional Helly theorem
0 references
VC-dimension
0 references
0 references
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (English)
0 references
0.9058025479316713
0 references
0.8006365299224854
0 references
0.7962644100189209
0 references
0.7946044206619263
0 references
0.7901172637939453
0 references
