Fast algorithms for diameter-optimally augmenting paths and trees (Q5384465)
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: Fast algorithms for diameter-optimally augmenting paths and trees |
scientific article; zbMATH DE number 7072202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for diameter-optimally augmenting paths and trees |
scientific article; zbMATH DE number 7072202 |
Statements
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (English)
0 references
24 June 2019
0 references
computational geometry
0 references
geometric graphs
0 references
diameter
0 references
approximation
0 references
parametric search
0 references
optimization
0 references
0 references
0 references
0.9798477292060852
0 references
0.9160089492797852
0 references
0.8386105298995972
0 references
