Author： Marathe M.V. Ravi R. Sundaram R. Ravi S.S. Rosenkrantz D.J. Hunt H.B.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.28, Iss.1, 1998-07, pp. : 142-171
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The non-approximability of bicriteria network design problems
By Balint V.
Journal of Discrete Algorithms, Vol. 1, Iss. 3, 2003-06 ,pp. :
Access to resources
Recommend
Approximation Algorithms for Network Design Problems on Bounded Subsets
Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. :
Chance‐constrained multi‐terminal network design problems
Naval Research Logistics: An International Journal, Vol. 62, Iss. 4, 2015-06 ,pp. :