Minimum Cost ≤k Edges Connected Subgraph Problems

DOI10.1016/j.endm.2010.05.004zbMath1237.90210OpenAlexW2041232017MaRDI QIDQ2883545

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

zbMATH Keywords

matchingnetwork modelsisomorphic graph

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Minimum Cost ≤k Edges Connected Subgraph Problems