Convergence of the non-uniform directed physarum model

DOI10.1016/j.tcs.2020.01.034zbMath1437.90098arXiv1906.07781OpenAlexW3004493982MaRDI QIDQ2306021

Kurt Mehlhorn, Andreas Karrenbauer, Pavel Kolev, Enrico Facca

Publication date: 20 March 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.07781

zbMATH Keywords

optimizationlinear programmingdynamical systemsphysarum polycephalum

Mathematics Subject Classification ID

Linear programming (90C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Stability of topological dynamical systems (37B25) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to biology (92-08) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items

Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Convergence of the non-uniform physarum dynamics ⋮ Fast Iterative Solution of the Optimal Transport Problem on Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Physarum can compute shortest paths: a short proof
• Numerical solution of Monge-Kantorovich equations via a dynamic formulation
• A mathematical model for adaptive transport network in path finding by true slime mold
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• Two results on slime mold computations
• A Slime Mold Solver for Linear Programming Problems
• Natural Algorithms for Flow Problems
• Towards a Stationary Monge--Kantorovich Dynamics: The Physarum Polycephalum Experience
• Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds