Partitioning trees of supply and demand
From MaRDI portal
Recommendations
- Minimum cost partitions of trees with supply and demand
- Minimum Cost Partitions of Trees with Supply and Demand
- A strongly polynomial time algorithm for the maximum supply rate problem on trees
- A strongly polynomial time algorithm for the maximum supply rate problem on trees
- Partitioning graphs of supply and demand
Cited in
(13)- Approximability of partitioning graphs with supply and demand
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- The shifting algorithm technique for the partitioning of trees
- Minimum cost partitions of trees with supply and demand
- Parametric power supply networks
- Minimum Cost Partitions of Trees with Supply and Demand
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- Parametric power supply networks (extended abstract)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Partition on trees with supply and demand: kernelization and algorithms
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
- Approximability of Partitioning Graphs with Supply and Demand
- Partitioning graphs of supply and demand
This page was built for publication: Partitioning trees of supply and demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427881)