On the Minimum Local-Vertex-Connectivity Augmentation in Graphs

  title={On the Minimum Local-Vertex-Connectivity Augmentation in Graphs},
  author={Hiroshi Nagamochi and Toshimasa Ishii},
Given a graph G and target values r(u; v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u; v) internally disjoint paths between each pair of vertices u and v. We show that the problem is NP-hard even if for some constant k¿ 2 G is (k−1)-vertex-connected and r(u; v)∈{0; k} holds for u; v∈V . We then give a linear time algorithm which delivers a 3 2 -approximation solution to… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-4 of 4 extracted citations


Publications referenced by this paper.
Showing 1-10 of 10 references

Solving the 2-edge or 2-vertex-connectivity augmentation problem for speciBed sets of vertices

  • K. Tsuchiya, T. Mashima, T. Watanabe
  • IPSJ SIG Notes, 96-AL-54
  • 1996
1 Excerpt

Connectivity augmentation problem in graphs, Ph.D. Thesis, Department of Computer Science, EV otvV os

  • T. JordJ an
  • 1994
1 Excerpt

Connectivity augmentation problems in network design

  • A. Frank
  • in: J.R. Birge, K.G. Murty (Eds.), Mathematical…
  • 1994
2 Excerpts

Computers and Intractability

  • M. R. Gary, D. S. Johnson
  • a Guide to the Theory of NP-completeness, Freeman…
  • 1978
1 Excerpt

On realizability of a set of integers as degrees of the vertices of a linear graph

  • L. S. Hakimi
  • J. SIAM 10
  • 1962
2 Excerpts

Similar Papers

Loading similar papers…