Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
From MaRDI portal
Publication:4732318
DOI10.1002/NET.3230190705zbMath0682.90090OpenAlexW2115981193MaRDI QIDQ4732318
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190705
Related Items (4)
A primal-dual approximation algorithm for the Steiner forest problem ⋮ An integer programming formulation of the Steiner problem in graphs ⋮ Continuous approximation formulas for location problems ⋮ A probabilistic analysis of the maximal covering location problem
Cites Work
This page was built for publication: Probabilistic analysis of an lp relaxation bound for the steiner problem in networks