Minimum cost k edges connected subgraph problems

DOI10.1016/J.ENDM.2010.05.004zbMATH Open1237.90210OpenAlexW2041232017MaRDI QIDQ2883545FDOQ2883545

Authors: Firdovsi Sharifov, Hakan Kutucu 

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.004

Recommendations

• scientific article; zbMATH DE number 1817738
• Approximating minimum size \{1,2\}-connected networks
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• A network design problem with two-edge matching failures
• Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

zbMATH Keywords

matchingnetwork modelsisomorphic graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• \(k\)-edge connected polyhedra on series-parallel graphs
• The k-Edge-Connected Spanning Subgraph Polyhedron
• Two-edge connected spanning subgraphs and polyhedra
• Steiner \(k\)-edge connected subgraph polyhedra
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• Connectivity-splitting models for survivable network design

Cited In (3)

• Problems of synthesis of connected networks with respect to isomorphic subgraphs
• \(k\)-edge subgraph problems
• Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph

This page was built for publication: Minimum cost \(\leq k\) edges connected subgraph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883545)