A Simple Greedy Algorithm for the k-Disjoint Flow Problem
From MaRDI portal
Publication:3630214
DOI10.1007/978-3-642-02017-9_32zbMath1241.90164OpenAlexW1516264807MaRDI QIDQ3630214
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_32
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (1)
This page was built for publication: A Simple Greedy Algorithm for the k-Disjoint Flow Problem