A strongly polynomial time algorithm for the maximum supply rate problem on trees

DOI10.1007/978-3-319-78455-7_5zbMath1436.68262OpenAlexW2792841422MaRDI QIDQ5896083

Yusuke Kobayashi, Koki Takayama

Publication date: 7 July 2020

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A strongly polynomial time algorithm for the maximum supply rate problem on trees