Approximating max-cut under graph-MSO constraints

被引：0
|
作者：
Koutecky, Martin [1 ,2 ]
Lee, Jon [3 ]
Nagarajan, Viswanath [3 ]
Shen, Xiangkun [3 ]
机构：
[1] Technion, Fac IE&M, Haifa, Israel
[2] Charles Univ Prague, Inst Comp Sci, Prague, Czech Republic
[3] Univ Michigan, IOE Dept, Ann Arbor, MI 48109 USA
来源：
OPERATIONS RESEARCH LETTERS | 2018年 / 46卷 / 06期
基金：
美国国家科学基金会; 以色列科学基金会;
关键词：
Max cut; Approximation algorithm; Monadic second-order logic; Treewidth; Dynamic program; ALGORITHMS; SIZES;
D O I：
10.1016/j.orl.2018.10.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the max-cut and max-kappa-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a 1/2-approximation algorithm for this class of problems. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：592 / 598
页数：7
相关论文
共 50 条
  • [1] Max-Cut Under Graph Constraints
    Lee, Jon
    Nagarajan, Viswanath
    Shen, Xiangkun
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 50 - 62
  • [2] Approximating graph-constrained max-cut
    Shen, Xiangkun
    Lee, Jon
    Nagarajan, Viswanath
    [J]. MATHEMATICAL PROGRAMMING, 2018, 172 (1-2) : 35 - 58
  • [3] Approximating graph-constrained max-cut
    Xiangkun Shen
    Jon Lee
    Viswanath Nagarajan
    [J]. Mathematical Programming, 2018, 172 : 35 - 58
  • [4] An Optimal Space Lower Bound for Approximating MAX-CUT
    Kapralov, Michael
    Krachun, Dmitry
    [J]. PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 277 - 288
  • [5] A MAX-CUT APPROXIMATION USING A GRAPH BASED MBO SCHEME
    Keetch, Blaine
    van Gennip, Yves
    [J]. DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B, 2019, 24 (11): : 6091 - 6139
  • [6] Multiple graph regularized graph transduction via greedy gradient Max-Cut
    Xiu, Yu
    Shen, Weiwei
    Wang, Zhongqun
    Liu, Sanmin
    Wang, Jun
    [J]. INFORMATION SCIENCES, 2018, 423 : 187 - 199
  • [7] Experimental performance of graph neural networks on random instances of max-cut
    Yao, Weichi
    Bandeira, Afonso S.
    Villar, Soledad
    [J]. WAVELETS AND SPARSITY XVIII, 2019, 11138
  • [8] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    [J]. UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [9] 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
  • [10] Semidefinite relaxations for max-cut
    Laurent, M
    [J]. THE SHARPEST CUT: THE IMPACT OF MANFRED PADBERG AND HIS WORK, 2004, 4 : 257 - 290
12345