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 条
  • [1] On the Connected Spanning Cubic Subgraph Problem
    Masse, Damien
    Euler, Reinhardt
    Lemarchand, Laurent
    CONVEXITY AND DISCRETE GEOMETRY INCLUDING GRAPH THEORY, 2016, 148 : 109 - 136
  • [2] A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem
    Zhao, L
    Nagamochi, H
    Ibaraki, T
    INFORMATION PROCESSING LETTERS, 2003, 86 (02) : 63 - 70
  • [3] A problem of finding the maximal spanning connected subgraph with given vertex degrees
    Gimadi, EK
    Serdyukov, AI
    OPERATIONS RESEARCH PROCEEDINGS 2000, 2001, : 55 - 59
  • [4] An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
    Hershkowitz, D. Ellis
    Kehne, Gregory
    Ravi, R.
    INFORMATION PROCESSING LETTERS, 2021, 167
  • [5] Minimum 2-vertex strongly biconnected spanning directed subgraph problem
    Jaberi, Raed
    DISCRETE MATHEMATICS LETTERS, 2021, 7 : 40 - 43
  • [6] On approximability of the minimum-cost k-connected spanning subgraph problem
    Czumaj, A
    Lingas, A
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 281 - 290
  • [7] Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
    Gubbala, P
    Raghavachari, B
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 422 - 436
  • [8] A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
    Civril, A.
    THEORETICAL COMPUTER SCIENCE, 2023, 943 : 121 - 130
  • [9] 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
  • [10] The Unbalanced Connected Subgraph Problem
    Gong, Shaohui
    Zhu, Cheng
    Tang, Luohao
    Zhu, Xianqiang
    Yu, Lianfei
    2020 5TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE, COMPUTER TECHNOLOGY AND TRANSPORTATION (ISCTT 2020), 2020, : 130 - 140
12345