A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.27, Iss.4, 2014-05, pp. : 663-678

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N. Goemans M.X. Williamson D.P.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

By Prömel H.J. Steger A.

Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. : 89-101

Academic Press

Access to resources Recommend Favorite

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

By Garg N. Konjevod G. Ravi R.

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 66-84

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms for Network Design Problems on Bounded Subsets

By Hochbaum D.S. Naor J.S.

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 403-414

Academic Press

Access to resources Recommend Favorite

An algorithm to solve the proportional network flow problem

By Morrison David Sauppe Jason Jacobson Sheldon

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 801-809

Springer Publishing Company

Access to resources Recommend Favorite