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 条
  • [41] A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
    Chitnis, Rajesh Hemant
    Esfandiari, Hossein
    Hajiaghayi, MohammadTaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Seddighin, Saeed
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 159 - 171
  • [42] The balanced connected subgraph problem for geometric intersection graphs
    Bhore, Sujoy
    Jana, Satyabrata
    Pandit, Supantha
    Roy, Sasanka
    THEORETICAL COMPUTER SCIENCE, 2022, 929 (69-80) : 69 - 80
  • [43] A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
    Chitnis, Rajesh
    Esfandiari, Hossein
    Hajiaghayi, MohammadTaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Seddighin, Saeed
    ALGORITHMICA, 2017, 77 (04) : 1216 - 1239
  • [44] A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
    Rajesh Chitnis
    Hossein Esfandiari
    MohammadTaghi Hajiaghayi
    Rohit Khandekar
    Guy Kortsarz
    Saeed Seddighin
    Algorithmica, 2017, 77 : 1216 - 1239
  • [45] Complexity and inapproximability results for balanced connected subgraph problem
    Martinod, T.
    Pollet, V
    Darties, B.
    Giroudeau, R.
    Konig, J-C
    THEORETICAL COMPUTER SCIENCE, 2021, 886 : 69 - 83
  • [46] ISPAN: Parallel Identification of Strongly Connected Components with Spanning Trees
    Ji, Yuede
    Liu, Hang
    Huang, H. Howie
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE, AND ANALYSIS (SC'18), 2018,
  • [47] ISPAN: Parallel Identification of Strongly Connected Components with Spanning Trees
    Ji, Yuede
    Liu, Hang
    Hu, Yang
    Huang, H. Howie
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2022, 9 (03)
  • [48] The complexity of the locally connected spanning tree problem
    Cai, LZ
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 63 - 75
  • [49] On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
    Goldschmidt, O
    Takvorian, A
    Yu, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (01) : 97 - 105
  • [50] Approximating the Smallest k-Edge Connected Spanning Subgraph by LP-Rounding
    Gabow, Harold N.
    Goemans, Michel X.
    Tardos, Eva
    Williamson, David P.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 562 - 571
12345