Pages that link to "Item:Q4302277"
From MaRDI portal
The following pages link to Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (Q4302277):
Displayed 15 items.
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- Improved approximations for the minimum-cut ratio and the flux (Q4866679) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem (Q5928874) (← links)
