Hardness of k-Vertex-Connected Subgraph Augmentation Problem

被引：0
|
作者：
Changcun Ma
Donghyun Kim
Yuexuan Wang
Wei Wang
Nassim Sohaee
Weili Wu
机构：
[1] Tsinghua University,Institute for Theoretical Computer Science
[2] University of Texas at Dallas,Department of Computer Science
[3] Xi’an Jiaotong University,Department of Mathematics
来源：
Journal of Combinatorial Optimization | 2010年 / 20卷
关键词：
Network survivability; Graph connectivity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given a k-connected graph G=(V,E) and V′⊂V, k-Vertex-Connected Subgraph Augmentation Problem (k-VCSAP) is to find S⊂V∖V′ with minimum cardinality such that the subgraph induced by V′∪S is k-connected. In this paper, we study the hardness of k-VCSAP in undirect graphs. We first prove k-VCSAP is APX-hard. Then, we improve the lower bound in two ways by relying on different assumptions. That is, we prove no algorithm for k-VCSAP has a PR better than O(log (log n)) unless P=NP and O(log n) unless NP⊆DTIME(nO(log log n)), where n is the size of an input graph.
引用
收藏
页码：249 / 258
页数：9
相关论文
共 50 条
  • [31] The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
    Bendali, F.
    Diarrassouba, I.
    Biha, M. Didi
    Mahjoub, A. R.
    Mailfert, J.
    DRCN: 2007 6TH INTERNATIONAL WORKSHOP ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS, 2007, : 281 - +
  • [32] The k-edge connected subgraph problem I:: Polytopes and critical extreme points
    Biha, MD
    Mahjoub, AR
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 381 : 117 - 139
  • [33] The Labeled Two Edge Connected Subgraph Problem
    Ben Salem, Mariem
    Taktak, Raouia
    2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1020 - 1025
  • [34] A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
    Laekhanukit, Bundit
    Gharan, Shayan Oveis
    Singh, Mohit
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 606 - 616
  • [35] A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
    Fernandes, CG
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 629 - 638
  • [36] The Triangle-Densest-k-Subgraph Problem: Hardness, Lovasz Extension, and Application to Document Summarization
    Konar, Aritra
    Sidiropoulos, Nicholas D.
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 4075 - 4082
  • [37] Vertex Decompositions of Sparse Graphs into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most k
    Borodin, O. V.
    Ivanova, A. O.
    Montassier, M.
    Ochem, P.
    Raspaud, A.
    JOURNAL OF GRAPH THEORY, 2010, 65 (02) : 83 - 93
  • [38] Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem
    Li, Xiaosong
    Zhang, Zhao
    Huang, Xiaohui
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 764 - 771
  • [39] Eternal Connected Vertex Cover Problem
    Fujito, Toshihiro
    Nakamura, Tomoya
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2020, 2020, 12337 : 181 - 192
  • [40] Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph
    Ishii, T
    Nagamochi, H
    Ibaraki, T
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (01) : 35 - 77
12345