Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems

被引：10
|
作者：
Chuzhoy, Julia [1 ]
Khanna, Sanjeev [1 ]
机构：
[1] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA
来源：
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING | 2007年
关键词：
D O I：
10.1145/1250790.1250817
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：179 / 188
页数：10
相关论文
共 50 条
  • [21] NUMBER OF CUT VERTICES AND CUT ARCS IN A STRONG DIRECTED GRAPH
    RAO, SB
    RAO, AR
    ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1972, 22 (3-4): : 411 - &
  • [22] Random sampling in cut, flow, and network design problems
    Karger, DR
    MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (02) : 383 - 413
  • [23] Online maximum directed cut
    Amotz Bar-Noy
    Michael Lampis
    Journal of Combinatorial Optimization, 2012, 24 : 52 - 64
  • [24] A strongly polynomial cut canceling algorithm for minimum cost submodular flow
    Iwata, S
    McCormick, ST
    Shigeno, M
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 304 - 320
  • [25] On the directed cut cone and polytope
    David Avis
    Conor Meagher
    Journal of Combinatorial Optimization, 2016, 31 : 1685 - 1708
  • [26] Isoperimetric Cut on a Directed Graph
    Chen, Mo
    Liu, Ming
    Liu, Jianzhuang
    Tang, Xiaoou
    2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, : 2109 - 2116
  • [27] On the directed cut cone and polytope
    Avis, David
    Meagher, Conor
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1685 - 1708
  • [28] New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut
    Abboud, Amir
    Cohen-Addad, Vincent
    Klein, Philip N.
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 996 - 1009
  • [29] Online maximum directed cut
    Bar-Noy, Amotz
    Lampis, Michael
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (01) : 52 - 64
  • [30] Online Maximum Directed Cut
    Bar-Noy, Amotz
    Lampis, Michael
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1124 - 1133
12345