Pages that link to "Item:Q3783316"
From MaRDI portal
The following pages link to Minimum augmentation of a tree to a K-edge-connected graph (Q3783316):
Displaying 4 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- The minimum augmentation of a directed tree to ak-edge-connected directed graph (Q3798671) (← links)
- The minimum augmentation of any graph to aK-edge-connected graph (Q3825104) (← links)