On the Solution of the Steiner Tree NP-Hard Problem via Physarum BioNetwork

  title={On the Solution of the Steiner Tree NP-Hard Problem via Physarum BioNetwork},
  author={Marcello Caleffi and Ian F. Akyildiz and Luigi Paura},
  journal={IEEE/ACM Transactions on Networking},
In the last several years, many algorithms trying to mimic biological processes have been proposed to enhance the performance of communication networks. However, the bio-inspired algorithms represent only the very first step toward the design of a smart adaptive communication network since: 1) they model only a limited set of the rules underlying the biological processes, thus, omitting fundamental functionalities; 2) they are executed on traditional computer architectures, thus, failing to… 

Solving the Steiner Tree Problem in Graphs using Physarum-inspired Algorithms

Experimental results indicate that PAs can compute Steiner trees, and it may be preferable to apply the authors' PAs to solve the Steiner Tree Problem in Graphs in some cases.

Bio-inspired Network Optimization Based on Semi-Definite Programming*

In order to design optimized network, a novel semi-definite programming (SDP) problem is formulated, and a new objective function is designed, which constitutes of the total network length and the determinant of the network Laplacian.

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

This paper proposes two fast heuristic algorithms and applies the best-known solution for a notoriously difficult benchmark instance to show that they can improve near-optimal solutions to PCSTP.

An Accelerated Physarum Solver for Network Optimization

This paper aims to address two issues by developing two enhancement strategies: pruning inactive nodes and terminating Physarum solver in advance, which saves considerable iterations while guaranteeing the optimality of the found solution.

Classical, prize-collecting and node-weighted Steiner tree problems in graphs

This thesis explores three Steiner tree problems in graphs, and proposes a Physaruminspired algorithm to solve this problem in pharmaceutical networks for drug repositioning, which manifests a more competitive performance than the widely-used Goemans-Williamson algorithm.

Efficient Communications in Wireless Sensor Networks Based on Biological Robustness

Through simulation in realistic conditions, it is demonstrated that bio-inspired WSNs are more reliable than existing solutions for the design of robust W SNs and have lower latency as well as lower energy consumption than the state of the art.

On Growing Computers from Living Biological Cells

This chapter focuses on the work that is being developed with slime mould at the University of Plymouth’s Interdisciplinary Centre for Computer Music Research (ICCMR), and tells the story a wild musical idea, born in 2009, and which resulted in the development of a biological processor that is capable of improvising music and doing Boolean logics.

Application of SMT problem EAI Endorsed Transactions on Context-aware Systems and Applications Research

The proposed Variable Neighborhood Search (VNS) algorithm for solving the SMT problem in sparse graphs yields better results than some other heuristic algorithms.

Energy efficient routing formation algorithm for hybrid ad-hoc network: A geometric programming approach

In this paper, a novel routing formation algorithm called Geometric programming based Energy Efficient Routing protocol (GEER) is proposed for hybrid ad-hoc network. It optimizes two sets of



Biological principles for future internet architecture design

The grand view is illustrated by not only taking inspiration from biology in the design process, but also sketching a possible way to implement biologically driven control in a future Internet architecture.

Reducibility Among Combinatorial Problems

  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.

Physarum Chip Project: Growing Computers From Slime Mould

Research in unconventional, or nature-inspired, computing aims to uncover novel principles of efficient information processing and computation in physical, chemical and biological systems, to develop

A fast algorithm for Steiner trees

The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.

SteinLib: An Updated Library on Steiner Tree Problems in Graphs

The SteinLib is presented, a library of data sets for the Steiner tree problem in graphs that extends former libraries on Steiners tree problems by many new interesting and difficult instances, most of them arising from real-world applications.