Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs

被引：5
|
作者：
Fan, Neng [1 ]
Golari, Mehdi [1 ]
机构：
[1] Univ Arizona, Dept Syst & Ind Engn, Tucson, AZ 85721 USA
来源：
COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014) | 2014年 / 8881卷
关键词：
Minimum spanning forest; Minimum spanning tree; Connected components; Network vulnerability analysis; Integer programming; TREE PROBLEM;
D O I：
10.1007/978-3-319-12691-3_46
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we first review several integer programming formulations for the minimum spanning tree problem, and then adapt these formulations for solving the minimum spanning forest problem in sparse graphs. Some properties for the spanning forest and connected components are studied, and then we present the integer programming formulation for finding the largest connected component, which has been widely used for network vulnerability analysis.
引用
收藏
页码：613 / 622
页数：10
相关论文
共 40 条
  • [1] Integer programming formulations for minimum spanning forests and connected components in sparse graphs
    Fan, Neng (nfan@email.arizona.edu), 1600, Springer Verlag (8881):
  • [2] Integer Programming Formulations for Minimum Spanning Tree Interdiction
    Wei, Ningji
    Walteros, Jose L.
    Pajouh, Foad Mahdavi
    INFORMS JOURNAL ON COMPUTING, 2021, 33 (04) : 1461 - 1480
  • [3] A survey of different integer programming formulations of the generalized minimum spanning tree problem
    Pop, P. C.
    CARPATHIAN JOURNAL OF MATHEMATICS, 2009, 25 (01) : 104 - 118
  • [4] Maintaining minimum spanning forests in dynamic graphs
    Henzinger, MR
    King, V
    SIAM JOURNAL ON COMPUTING, 2001, 31 (02) : 364 - 374
  • [5] Minimum Spanning Tree Method for Sparse Graphs
    Wang, Xianchao
    Li, Shaoyi
    Hou, Changhui
    Zhang, Guoming
    Mathematical Problems in Engineering, 2023, 2023
  • [6] Optimal connected subgraphs: Integer programming formulations and polyhedra
    Rehfeldt, Daniel
    Franz, Henriette
    Koch, Thorsten
    NETWORKS, 2022, 80 (03) : 314 - 332
  • [7] Integer programming formulations for minimum deficiency interval coloring
    Bodur, Merve
    Luedtke, James R.
    NETWORKS, 2018, 72 (02) : 249 - 271
  • [8] Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs
    Kang, Dong Yeap
    COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (03): : 423 - 464
  • [9] Undirected simple connected graphs with minimum number of spanning trees
    Bogdanowicz, Zbigniew R.
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3074 - 3082
  • [10] Integer programming formulations for the minimum weighted maximal matching problem
    Taskin, Z. Caner
    Ekim, Tinaz
    OPTIMIZATION LETTERS, 2012, 6 (06) : 1161 - 1171
1234