Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712)
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: Optimal approximation algorithms for maximum distance-bounded subgraph problems |
scientific article; zbMATH DE number 6879865
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal approximation algorithms for maximum distance-bounded subgraph problems |
scientific article; zbMATH DE number 6879865 |
Statements
Optimal approximation algorithms for maximum distance-bounded subgraph problems (English)
0 references
1 June 2018
0 references
\(d\)-clique
0 references
\(d\)-club
0 references
maximum distance-bounded subgraph problems
0 references
(in)approximability
0 references
0 references
0 references
0.94593835
0 references
0.93834174
0 references
0.9167761
0 references
0.90896857
0 references
0.90800357
0 references
0.9068517
0 references
0.90625167
0 references
