An exact algorithm for MAX-CUT in sparse graphs

被引：10
|
作者：
Della Croce, F.
Kaminski, M. J.
Paschos, V. Th.
机构：
[1] Rutgers State Univ, RUTCOR, Piscataway, NJ 08854 USA
[2] DAI, Politecn Torino, Turin, Italy
[3] Univ Paris 09, F-75775 Paris 16, France
来源：
OPERATIONS RESEARCH LETTERS | 2007年 / 35卷 / 03期
基金：
美国国家科学基金会;
关键词：
MAX-CUT; exact algorithm; sparse graphs;
D O I：
10.1016/j.orl.2006.04.001
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O*(2((l-(2/Delta))n)). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O*(2(mn/(m+n))). Both algorithms use polynomial space. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：403 / 408
页数：6
相关论文
共 50 条
  • [1] On the max-cut of sparse random graphs
    Gamarnik, David
    Li, Quan
    RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
  • [2] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [3] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
  • [4] Branch and Cut based on the volume algorithm:: Steiner trees in graphs and Max-cut
    Barahona, Francisco
    Ladanyi, Laszlo
    RAIRO-OPERATIONS RESEARCH, 2006, 40 (01) : 53 - 73
  • [5] MAX-CUT on Samplings of Dense Graphs
    Fakcharoenphol, Jittat
    Vajanopath, Phanu
    2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [6] MAX-CUT and containment relations in graphs
    Kaminski, Marcin
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 89 - 95
  • [7] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
  • [8] Partial Lasserre relaxation for sparse Max-Cut
    Campos, Juan S.
    Misener, Ruth
    Parpas, Panos
    OPTIMIZATION AND ENGINEERING, 2023, 24 (03) : 1983 - 2004
  • [9] A memetic algorithm for the max-cut problem
    Lin, Geng
    Zhu, Wenxing
    INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2015, 6 (01) : 69 - 77
  • [10] Partial Lasserre relaxation for sparse Max-Cut
    Juan S. Campos
    Ruth Misener
    Panos Parpas
    Optimization and Engineering, 2023, 24 : 1983 - 2004
12345