Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323)
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: Improved approximability and non-approximability results for graph diameter decreasing problems |
scientific article; zbMATH DE number 6014313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximability and non-approximability results for graph diameter decreasing problems |
scientific article; zbMATH DE number 6014313 |
Statements
Improved approximability and non-approximability results for graph diameter decreasing problems (English)
0 references
13 March 2012
0 references
approximation algorithms
0 references
graphs
0 references
edge addition
0 references
diameter
0 references
0 references
0.9947815537452698
0 references
0.8874792456626892
0 references
0.8012216687202454
0 references
