Solving Steiner trees: Recent advances, challenges, and perspectives
I Ljubić - Networks, 2021 - Wiley Online Library
The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
A min-max regret approach for the Steiner Tree Problem with Interval Costs
Let G=(V, E) be a connected graph, where V and E represent, respectively, the node-set and
the edge-set. Besides, let Q\subseteq V be a set of terminal nodes, and r\in Q be the root …
the edge-set. Besides, let Q\subseteq V be a set of terminal nodes, and r\in Q be the root …
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
The Prize-collecting Steiner tree (PCST) problem is a generalization of the Steiner tree
problem that finds applications in network design, content distribution networks, and many …
problem that finds applications in network design, content distribution networks, and many …