A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
スポンサーリンク
概要
- 論文の詳細を見る
The 2-vertex-connectivity augmentation problem for specified vertices (2VCA-SV) is defined as follows : Given an undirected graph G=(V, E), a subgraph G_0=(V, E') of G, a specified set of vertices S⊆V and a weight function w : E→R^+(nonnegative real numbers), find a set E"⊆E-E' with the minimum total weight, such that G_0+E"=(V, E'∪E") has at least two internally disjoint paths between any pair of vertices in S. In this paper, we propose an O(|V||E|+|V|^2log|V|) time algorithm 2-ABIS, whose performance ratio is 2 (3, respectively), for 2VCA-SV if G_0 has a connected component containing S (otherwise).
- 社団法人電子情報通信学会の論文
- 2003-04-01
著者
-
TAOKA Satoshi
Graduate School of Engineering, Hiroshima University
-
WATANABE Toshimasa
Graduate School of Engineering, Hiroshima University
-
Taoka S
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Taoka Satoshi
Graduate School Of Engineering Hiroshima University
-
Tamura M
Graduate School Of Engineering Hiroshima University
-
TAMURA Makoto
Graduate School of Engineering, Hiroshima University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima University
-
Tamura Makoto
Graduate School Of Engineering Hiroshima University
-
Watanabe T
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Watanabe T
Hiroshima Univ.
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima Univ.
関連論文
- Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs(Concurrent Systems,Concurrent/Hybrid Systems: Theory and Applications)
- A Fast Algorithm for (σ+1)-Edge-Connectivity Augmentation of a σ-Edge-Connected Graph with Multipartition Constraints
- A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
- A (2 - 2/|L|)-Approximation Algorithm R2VS or R2ES to 2-Vertex- or 2-Edge-Connect Specified Vertices in a Graph
- Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets
- Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets (Special Section on Concurrent Systems Technology)
- Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
- Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets(Concurrent/Hybrid Systems : Theory and Applications)
- Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
- Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
- Performance Comparison of Algorithms for the Dynamic Shortest Path Problem(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- A 2-Approximation Algorithm to (k+1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph(Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms
- A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
- Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs
- Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets