Natural algorithms for flow problems

DOI10.1137/1.9781611974331.CH131MaRDI QIDQ4575715zbMATH OpenOpenAlexFDO

Authors Damian Straszak, Nisheeth K. Vishnoi

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch131

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• \textit{Physarum} can compute shortest paths
• \textit{Physarum} can compute shortest paths
• Physarum can compute shortest paths: convergence proofs and complexity bounds
• A Slime Mold Solver for Linear Programming Problems
• Two results on slime mold computations

Cited in

(20)

• Physarum can compute shortest paths: a short proof
• On the convergence time of a natural dynamics for linear programming
• A Laplacian approach to _1-norm minimization
• Physarum-inspired multi-commodity flow dynamics
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence
• Convergence of the non-uniform directed physarum model
• Convergence of the non-uniform physarum dynamics
• \textit{Physarum} solver: a bio-inspired method for sustainable supply chain network design problem
• Two results on slime mold computations
• \textit{Physarum} can compute shortest paths
• Algorithmic Properties of Millstream Systems
• scientific article; zbMATH DE number 3963398 (Why is no real title available?)
• \textit{Physarum}-inspired applications in graph-optimization problems
• Geodesic Walks in Polytopes
• A revised model of fluid transport optimization in \textit{Physarum polycephalum}
• On the convergence time of a natural dynamics for linear programming
• Physarum can compute shortest paths: convergence proofs and complexity bounds
• \textit{Physarum} can compute shortest paths
• On the use of naturality in algorithmic resolution
• Fast algorithms for _p-regression

This page was built for publication: Natural algorithms for flow problems

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