Presentation 1998/4/24
K-Edge-Connectivity Augmentation of a Graph with Upper Bounds on the Multiplicity of Added Edges
Daisuke Takafuji, Makoto Okada, Toshimasa Watanabe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The k-edge-connectivity augmentation problem of a graph with upper bounds on the multiplicity of added edges (kECA-UB, for short) is defined as follows : "Given a graph G = (V, E) and a function f : V × V → Z^+^ (nonnegative integers), find an edge set of minimum cardinality among those sets E′ such that G′ = (V, E∪E′) is k-edge connected and, for any two vertices u, v, the number of edges added between u and v is no more than f(u, v)." In this paper, we first show that this problem is NP-complete. Then we propose three heuristic algorithms for kECA-UB and compare their capability through experiment.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) NP-completeness / approximation algorithms / performance ratios
Paper #
Date of Issue

Conference Information
Committee COMP
Conference Date 1998/4/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) K-Edge-Connectivity Augmentation of a Graph with Upper Bounds on the Multiplicity of Added Edges
Sub Title (in English)
Keyword(1) NP-completeness
Keyword(2) approximation algorithms
Keyword(3) performance ratios
1st Author's Name Daisuke Takafuji
1st Author's Affiliation Graduate School of Engineering, Hiroshima University()
2nd Author's Name Makoto Okada
2nd Author's Affiliation Department of Circuits and Systems, Faculty of Engineering, Hiroshima University
3rd Author's Name Toshimasa Watanabe
3rd Author's Affiliation Department of Circuits and Systems, Faculty of Engineering, Hiroshima University
Date 1998/4/24
Paper #
Volume (vol) vol.98
Number (no) 36
Page pp.pp.-
#Pages 8
Date of Issue