The 2-Edge-Connected Subgraph Polyhedron

Author： Vandenbussche Dieter   Nemhauser George  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.9, Iss.4, 2005-06, pp. : 357-379

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

Abstract

Related content

2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs

By Okamura Haruko  

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 571-589

Springer Publishing Company

Access to resources Recommend Favorite

Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 55, Iss. 1, 1976-03 ,pp. : 87-92

John Wiley & Sons Inc

Access to resources Recommend Favorite

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

By Auletta V.   Dinitz Y.   Nutov Z.   Parente D.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 21-30

Academic Press

Access to resources Recommend Favorite

A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem

By Fernandes C.G.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 105-124

Academic Press

Access to resources Recommend Favorite

Finding 2-edge connected spanning subgraphs

By Huh W.T.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 212-216

Elsevier

Access to resources Recommend Favorite