Natural algorithms for flow problems

DOI10.1137/1.9781611974331.CH131zbMATH Open1410.68126OpenAlexW4244732212MaRDI QIDQ4575715FDOQ4575715

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

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

Mathematics Subject Classification ID

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

Cited In (13)

• On the convergence time of a natural dynamics for linear programming
• Convergence of the non-uniform physarum dynamics
• Geodesic Walks in Polytopes
• Algorithmic Properties of Millstream Systems
• 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
• On the use of naturality in algorithmic resolution
• A Laplacian approach to \(\ell_1\)-norm minimization
• On the Convergence Time of a Natural Dynamics for Linear Programming
• Two results on slime mold computations
• A revised model of fluid transport optimization in \textit{Physarum polycephalum}
• Title not available (Why is that?)

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)