Multicommodity demand flow in a tree and packing integer programs
From MaRDI portal
Publication:3580938
Cited in
(33)- Almost polynomial hardness of node-disjoint paths in grids
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- Routing in undirected graphs with constant congestion
- A logarithmic approximation for unsplittable flow on line graphs
- Stochastic makespan minimization in structured set systems (extended abstract)
- Pricing on paths: a PTAS for the highway problem
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- Stochastic makespan minimization in structured set systems
- Flexible bandwidth assignment with application to optical networks
- Iterative packing for demand and hypergraph matching
- Improved algorithm for resource allocation problems
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- Improved algorithms for resource allocation under varying capacity
- Approximability of sparse integer programs
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- Packing cars into narrow roads: PTASs for limited supply highway
- Resource allocation problem under single resource assignment
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Stochastic unsplittable flows
- Scheduling Resources for Throughput Maximization
- A constant factor approximation algorithm for the storage allocation problem
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Parametric power supply networks
- On the complexity of anchored rectangle packing
- Multicommodity flow in trees: packing via covering and iterated relaxation
- New algorithms for maximum disjoint paths based on tree-likeness
- Flexible resource allocation to interval jobs
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- A knapsack intersection hierarchy
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- The prize-collecting call control problem on weighted lines and rings
This page was built for publication: Multicommodity demand flow in a tree and packing integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580938)
