An efficient approximation algorithm for the survivable network design problem

Author： Gabow H.N. Goemans M.X. Williamson D.P.

Publisher： Elsevier

ISSN： 0025-5610

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

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

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

By Zhang Peng

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

Springer Publishing Company

Access to resources Recommend Favorite

Multi-links recovery algorithm in survivable WDM optical network

By Zheng Wei Liu Sanyang Qi Xiaogang

Photonic Network Communications, Vol. 21, Iss. 1, 2011-02 ,pp. : 39-44

Springer Publishing Company

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 efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

By Davydov G.

Annals of Mathematics and Artificial Intelligence, Vol. 23, Iss. 3-4, 1998-01 ,pp. : 229-245

Springer Publishing Company

Access to resources Recommend Favorite