A strongly polynomial time algorithm for the maximum supply rate problem on trees
From MaRDI portal
Publication:5896083
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transportation, logistics and supply chain management (90B06)
Recommendations
- A strongly polynomial time algorithm for the maximum supply rate problem on trees
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- The \(p\)-maxian problem on a tree
- On the approximability of some maximum spanning tree problems
- On the approximability of some Maximum Spanning Tree Problems
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- On the Maximum Stable Throughput of Tree Algorithms With Free Access
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
Cited in
(5)
This page was built for publication: A strongly polynomial time algorithm for the maximum supply rate problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896083)