Pages that link to "Item:Q1944093"

The following pages link to A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093):

Displayed 5 items.

• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) ‎ (← links)
• Covering a laminar family by leaf to leaf links (Q987693) ‎ (← links)
• Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) ‎ (← links)
• A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) ‎ (← links)
• (Q5111750) ‎ (← links)