Hardness of \(k\)-vertex-connected subgraph augmentation problem
type: Item
instance of: scholarly article
title: Hardness of \(k\)-vertex-connected subgraph augmentation problem
zbMATH Open document ID: 1206.90151
author: Changcun Ma
author: Donghyun Kim
author: Yuexuan Wang
author: Wei Wang
author: Nassim Sohaee
author: Weili Wu
published in: Journal of Combinatorial Optimization
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5815477
zbMATH Keywords: network survivability
zbMATH Keywords: graph connectivity
MaRDI profile type: Publication
full work available at URL: s10878-008-9206-5
OpenAlex ID: W2143720330
cites work: Approximating theDomatic Number
cites work: Approximation Algorithms for Several Graph Augmentation Problems
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Hardness of Approximation for Vertex-Connectivity Network Design Problems
cites work: The hardness of approximation: Gap location
cites work: Q4527015
DOI: 10.1007/S10878-008-9206-5
description: scientific article; zbMATH DE number 5815477