Stronger linear programming relaxations of max-cut

被引：0
|
作者：
David Avis
Jun Umemoto
机构：
[1] Mcgill University and GERAD,Computer Science
[2] Kyoto University,Graduate School of Informatics
来源：
Mathematical Programming | 2003年 / 97卷
关键词：
Linear Programming Relaxation; Sparse Graph; Dense Graph; Random Sparse Graph; Integrality Ratio;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider linear programming relaxations for the max cut problem in graphs, based on k-gonal inequalities. We show that the integrality ratio for random dense graphs is asymptotically 1+1/k and for random sparse graphs is at least 1+3/k. There are O(nk)k-gonal inequalities. These results generalize work by Poljak and Tuza, who gave similar results for k=3.
引用
收藏
页码：451 / 469
页数：18
相关论文
共 50 条
  • [31] MAX-CUT on Samplings of Dense Graphs
    Fakcharoenphol, Jittat
    Vajanopath, Phanu
    [J]. 2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [32] MAX-CUT BY EXCLUDING BIPARTIT SUBGRAPHS
    Wu, Shufei
    Li, Amin
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2023, 108 (02) : 177 - 186
  • [33] Rank of Handelman hierarchy for Max-Cut
    Park, Myoung-Ju
    Hong, Sung-Pil
    [J]. OPERATIONS RESEARCH LETTERS, 2011, 39 (05) : 323 - 328
  • [34] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
  • [35] Randomized heuristics for the MAX-CUT problem
    Festa, P
    Pardalos, PM
    Resende, MGC
    Ribeiro, CC
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (06): : 1033 - 1058
  • [36] Subexponential LPs Approximate Max-Cut
    Hopkins, Samuel B.
    Schramm, Tselil
    Trevisan, Luca
    [J]. 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 943 - 953
  • [37] MAX-CUT and containment relations in graphs
    Kaminski, Marcin
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 438 : 89 - 95
  • [38] A Continuation Algorithm for Max-Cut Problem
    Feng Min XU
    Cheng Xian XU
    Xing Si LI
    [J]. Acta Mathematica Sinica,English Series, 2007, 23 (07) : 1257 - 1264
  • [39] Max-Cut Under Graph Constraints
    Lee, Jon
    Nagarajan, Viswanath
    Shen, Xiangkun
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 50 - 62
  • [40] Lagrangian Smoothing Heuristics for Max-Cut
    Hernán Alperin
    Ivo Nowak
    [J]. Journal of Heuristics, 2005, 11 : 447 - 463
12345