scientific article; zbMATH DE number 2038727
From MaRDI portal
Publication:4449192
Recommendations
Cited in
(17)- Resource allocation in bounded degree trees
- A fixed-parameter tractability result for multicommodity demand flow in trees
- Designing multi-commodity flow trees
- Path multicoloring in spider graphs with even color multiplicity
- Path multicoloring with fewer colors in spiders and caterpillars
- Minimizing maximum fiber requirement in optical networks
- Improved algorithms for scheduling unsplittable flows on paths
- Online Multi-Commodity Flow with High Demands
- The all-or-nothing multicommodity flow problem
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- scientific article; zbMATH DE number 2086940 (Why is no real title available?)
- Designing multi-commodity flow trees
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- Multicommodity flow in trees: packing via covering and iterated relaxation
- The Demand-Matching Problem
- A note on multiflows and treewidth
- A flexible model for tree-structured multi-commodity markets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449192)