Pages that link to "Item:Q2464340"
From MaRDI portal
The following pages link to Bounded-diameter minimum-cost graph problems (Q2464340):
Displaying 9 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems (Q1196217) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- (Q5136224) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)