Minimum Cardinality Point-to-point Connectivity Augmentation Problem

DOI10.3233/FI-2018-1690MaRDI QIDQ4692118zbMATH OpenOpenAlexFDO

Authors Mehdy Roayaei, Mohammadreza Razzazi

Publication date 26 October 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2018-1690

zbMATH Keywords

bridge-connectivityFPT-algorithmgraph augmentationpoint-to-point connectivitystrong-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Improved approximation algorithms for min-cost connectivity augmentation problems
• Approximating connectivity augmentation problems
• Approximating connectivity augmentation problems
• Approximation algorithms for connectivity augmentation problems
• Approximating Node-Connectivity Augmentation Problems
• Approximating node-connectivity augmentation problems
• scientific article; zbMATH DE number 1263261
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems

Cited in

(1)

• On the fixed-parameter tractability of the maximum connectivity improvement problem

This page was built for publication: Minimum Cardinality Point-to-point Connectivity Augmentation Problem

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