Pages that link to "Item:Q991474"
From MaRDI portal
The following pages link to An improved approximation algorithm for requirement cut (Q991474):
Displaying 9 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Improved approximation for fractionally subadditive network design (Q2011025) (← links)
- Terminal embeddings (Q2405893) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- (Q5111735) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)