The cavity approach for Steiner trees packing problems
DOI10.1088/1742-5468/aaeb3fzbMath1456.68127arXiv1712.07041OpenAlexW3101763604WikidataQ128833193 ScholiaQ128833193MaRDI QIDQ3303270
Anna Paola Muntoni, Alfredo Braunstein
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07041
Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Uses Software
Cites Work
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- The Steiner tree packing problem in VLSI design
- The cavity method at zero temperature
- Steiner tree packing revisited
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Shortest node-disjoint paths on random graphs
- Information, Physics, and Computation
- A rigorous analysis of the cavity equations for the minimum spanning tree
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Reducibility among Combinatorial Problems
This page was built for publication: The cavity approach for Steiner trees packing problems
