Pages that link to "Item:Q3580938"
From MaRDI portal
The following pages link to Multicommodity demand flow in a tree and packing integer programs (Q3580938):
Displayed 34 items.
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Flexible resource allocation to interval jobs (Q1999968) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- Parametric power supply networks (Q2354290) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← 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)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Resource allocation problem under single resource assignment (Q4553878) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) (Q5041742) (← links)
- On the complexity of anchored rectangle packing (Q5075741) (← links)
- (Q5075798) (← links)
- (Q5158500) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)