An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality.

DOI10.1007/B13810zbMATH Open1257.68148OpenAlexW3144329707MaRDI QIDQ5897356FDOQ5897356

Authors: Alessandro Ferrante, Mimmo Parente 

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13810

Recommendations

• ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
• On \(k\)-connectivity problems with sharpened triangle inequality
• scientific article; zbMATH DE number 2011856
• Improved Approximation Algorithms for Uniform Connectivity Problems
• On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Connectivity (05C40)

Cited In (5)

• ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(k\)-connectivity problems with sharpened triangle inequality
• Better algorithms for minimum weight vertex-connectivity problems

This page was built for publication: An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality.

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