A Simple Greedy Algorithm for the k-Disjoint Flow Problem

DOI10.1007/978-3-642-02017-9_32MaRDI QIDQ3630214zbMATH OpenOpenAlexFDO

Authors Maren Martens

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 1947385
• scientific article; zbMATH DE number 1187149
• On the disjoint paths problem

Cited in

(2)

• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• Approximate duality of multicommodity multiroute flows and cuts: single source case

This page was built for publication: A Simple Greedy Algorithm for the k-Disjoint Flow Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630214)