Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
From MaRDI portal
Publication:4732318
DOI10.1002/net.3230190705zbMath0682.90090MaRDI 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
A primal-dual approximation algorithm for the Steiner forest problem, A probabilistic analysis of the maximal covering location problem, An integer programming formulation of the Steiner problem in graphs
Cites Work