On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency

被引：5

作者：

Skutella, Martin ^{[1
]}

Weber, Alexia ^{[1
]}

机构：

[1] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany

来源：

MATHEMATICAL PROGRAMMING | 2010年 / 124卷 / 1-2期

关键词：

Flows; Cuts; Polyhedral combinatorics; POLYHEDRON; NETWORK;

D O I：

10.1007/s10107-010-0373-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P(s-t-cut)(up arrow) of the s-t-cut polytope. We present a complete characterization of P(s-t-cut)(up arrow) with respect to vertices, facets, and adjacency.

引用

页码：441 / 454

页数：14

共 50 条

[31] Minimum Label s-t Cut has large integrality gaps
Zhang, Peng
Tang, Linqing
[J]. INFORMATION AND COMPUTATION, 2020, 275
[32] Connection of Optimal Stopping Time to s-t Cut Problems on Trees
Wang, Yijin
Ornik, Melkior
Dong, Roy
[J]. IEEE CONTROL SYSTEMS LETTERS, 2023, 7 : 3729 - 3734
[33] A new approximation algorithm for the unbalanced Min s-t Cut problem
Zhang, Peng
[J]. THEORETICAL COMPUTER SCIENCE, 2016, 609 : 658 - 665
[34] Cornucopia: CAS Research Dominant in Top 10 S&T News
SONG Jianlan
[J]. Bulletin of the Chinese Academy of Sciences, 2016, 30 (01) : 23 - 28
[35] A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem
Zhang, Peng
[J]. COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 346 - 356
[36] Excellent photoelectrochemical activity of Bi2S3 nanorod/TiO2 nanoplate composites with dominant {001} facets
Huang, Guozhou
Zhang, Jun
Jiang, Fan
Zhang, Zhao
Zeng, Jinghui
Qi, Xiang
Shen, Zhenjiang
Wang, Hongbo
Kong, Zhe
Xi, Junhua
Ji, Zhenguo
[J]. JOURNAL OF SOLID STATE CHEMISTRY, 2020, 281
[37] Minimum s - t cut in undirected planar graphs when the source and the sink are close
Kaplan, Haim
Nussbaum, Yahav
[J]. 28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 117 - 128
[38] Dystopia fatigue doesn't cut it, or, Blade Runner 2049's utopian longings
Guynes, Sean
[J]. SCIENCE FICTION FILM AND TELEVISION, 2020, 13 (01) : 143 - 148
[39] A competitive study of the pseudoflow algorithm for the minimum s–t cut problem in vision applications
B. Fishbain
Dorit S. Hochbaum
Stefan Mueller
[J]. Journal of Real-Time Image Processing, 2016, 11 : 589 - 609
[40] An Unusually Hard Endobronchial Mass - Occam's Razor Doesn't Make the Cut
Hafiz, A.
Smith, R.
Sauthoff, H.
Tsay, J.
Shekar, S. Palasamudram
Bessich, J. L.
Ladak, N.
Narula, N.
Qin, J.
Pei, Z.
[J]. AMERICAN JOURNAL OF RESPIRATORY AND CRITICAL CARE MEDICINE, 2020, 201

← 1 2 3 4 5 →