Pages that link to "Item:Q4575906"

The following pages link to Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (Q4575906):

Displaying 10 items.

• LP-relaxations for tree augmentation (Q1706120) (← links)
• Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
• On small-depth tree augmentations (Q2102832) (← links)
• Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
• 2-node-connectivity network design (Q2117701) (← links)
• The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
• On the tree augmentation problem (Q2659770) (← links)
• Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
• How to Secure Matchings Against Edge Failures (Q5090488) (← links)
• (Q5111750) (← links)