Pages that link to "Item:Q3638868"
From MaRDI portal
The following pages link to Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs (Q3638868):
Displaying 16 items.
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- Parametric power supply networks (Q2354290) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Parametric Power Supply Networks (Q4925242) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- (Q5075798) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
