Pages that link to "Item:Q5171158"
From MaRDI portal
The following pages link to Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158):
Displaying 17 items.
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- Terminal embeddings (Q2405893) (← links)
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Extensions and limits to vertex sparsification (Q2875131) (← links)
- Vertex Sparsification in Trees (Q2971161) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Approximation Schemes for Multi-Budgeted Independence Systems (Q3586491) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q5111733) (← links)
- (Q5111734) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
