Capacity Expansion Problem of Strongly Connected Spanning Subgraph with Constraints

被引：1

作者：

Yang, Zilan ^{[1
]}

Li, Rui ^{[1
]}

Chen, Bin ^{[1
]}

机构：

[1] Lijiang Cultural & Tourism Coll, Sch Informat, Lijiang, Peoples R China

来源：

2022 INTERNATIONAL CONFERENCE ON INDUSTRIAL IOT, BIG DATA AND SUPPLY CHAIN, IIOTBDSC | 2022年

基金：

中国国家自然科学基金;

关键词：

strongly communication network; connected subgraph; NP-hard; heuristic algorithm; polynomial time algorithm; NETWORK;

D O I：

10.1109/IIoTBDSC57192.2022.00063

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Based on the congestion problem faced by flow transmission equipment in communication networks, in this paper, the capacity expansion problem of strongly connected spanning subgraph with constraints (CEPSCSSC) in directed networks is proposed. Firstly, NP-hardness is analyzed via Hamiltonian cycle problem. Secondly, a strongly connected spanning subgraph G' is constructed by looking for an inverse spanning arborescence and a spanning arborescence with the same root vertex through using Chu-Liu-Edmonds algorithm, and then G' is modified until the constraint conditions are satisfied by using the basic transformation of the spanning arborescence and the inverse spanning arborescence. so a heuristic algorithm, using the idea of arc exchange with the minimum weight increment, is designed to solve the CEPSCSSC problem. Finally, it is proved that the heuristic algorithm is correct and its time complexity is O (mnlogn).

引用

页码：305 / 310

页数：6

共 50 条

[21] Wildlife corridors as a connected subgraph problem
Conrad, Jon M.
Gomes, Carla P.
van Hoeve, Willem-Jan
Sabharwal, Ashish
Suter, Jordan F.
JOURNAL OF ENVIRONMENTAL ECONOMICS AND MANAGEMENT, 2012, 63 (01) : 1 - 18
[22] Iterated Rounding Algorithms for the Smallest κ-Edge Connected Spanning Subgraph
Gabow, Harold N.
Gallagher, Suzanne
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 550 - 559
[23] PARALLEL COMPLEXITY OF THE CONNECTED SUBGRAPH PROBLEM
KIROUSIS, LM
SERNA, M
SPIRAKIS, P
SIAM JOURNAL ON COMPUTING, 1993, 22 (03) : 573 - 586
[24] Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
Chen, Xin
Shi, Jieming
Peng, You
Lin, Wenqing
Wang, Sibo
Zhang, Wenjie
PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (06): : 1324 - 1336
[25] A class of network capacity expansion problem with N constraints
Wu, Y
Yang, C
Yang, J
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS 1 AND 2, 2004, : 262 - 265
[26] THE MINIMUM SPANNING SUBGRAPH PROBLEM WITH GIVEN CYCLOMATIC NUMBER
Wang, Qin
Yuan, Jinjiang
PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (04): : 583 - 592
[27] AN O(log2 k)-APPROXIMATION ALGORITHM FOR THE k-VERTEX CONNECTED SPANNING SUBGRAPH PROBLEM
Fakcharoenphol, Jittat
Laekhanukit, Bundit
SIAM JOURNAL ON COMPUTING, 2012, 41 (05) : 1095 - 1109
[28] An O(log2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
Fakcharoenphol, Jittat
Laekhanukit, Bundit
STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 153 - 158
[29] Minimum 2-edge connected spanning subgraph of certain graphs
Roy, S.
William, Albert
Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 92 : 255 - 264
[30] 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

← 1 2 3 4 5 →