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 条

[41] 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
[42] Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem
Zhang, Peng
Fu, Bin
Tang, Linqing
[J]. ALGORITHMICA, 2018, 80 (01) : 398 - 409
[43] A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
[J]. Apers, Simon (smgapers@gmail.com), 2021, arXiv
[44] Minimal cut sets of s-t networks with k-out-of-n nodes
Tan, ZB
[J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2003, 82 (01) : 49 - 54
[45] An Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution
Fujii, Yuki
Wadayama, Tadashi
[J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2895 - 2899
[46] 基于Minimum s-t Cut三维表面重建算法
詹洋
尹颜朋
[J]. 现代计算机, 2018, (02) : 34 - 37
[47] Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem
Peng Zhang
Bin Fu
Linqing Tang
[J]. Algorithmica, 2018, 80 : 398 - 409
[48] A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications
Fishbain, B.
Hochbaum, Dorit S.
Mueller, Stefan
[J]. JOURNAL OF REAL-TIME IMAGE PROCESSING, 2016, 11 (03) : 589 - 609
[49] Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm
Dang, CY
[J]. NEURAL NETWORKS, 2000, 13 (07) : 801 - 810
[50] Multi-label MRF Optimization via a Least Squares s-t Cut
Hamarneh, Ghassan
[J]. ADVANCES IN VISUAL COMPUTING, PT 1, PROCEEDINGS, 2009, 5875 : 1055 - 1066

← 1 2 3 4 5 →