From Graph Orientation to the Unweighted Maximum Cut

被引：0
|
作者：
Ben-Ameur, Walid [1 ]
Glorieux, Antoine [1 ]
Neto, Jose [1 ]
机构：
[1] Univ Paris Saclay, CNRS, Samovar UMR 5157, Telecom SudParis, 9 Rue Charles Fourier, F-91011 Evry, France
来源：
COMPUTING AND COMBINATORICS, COCOON 2016 | 2016年 / 9797卷
关键词：
MAX-CUT; SPECTRAL BOUNDS; RELAXATIONS;
D O I：
10.1007/978-3-319-42634-1_30
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, starting from graph orientation problems, we introduce some new mixed integer linear programming formulations for the unweighted maximum cut problem. Then a new semidefinite relaxation is proposed and shown to be tighter than the Goemans and Williamson's semidefinite relaxation. Preliminary computational results are also reported.
引用
收藏
页码：370 / 384
页数：15
相关论文
共 50 条
  • [1] FINDING MAXIMUM CUT IN A GRAPH
    ORLOVA, GI
    DORFMAN, YG
    ENGINEERING CYBERNETICS, 1972, 10 (03): : 502 - 506
  • [2] UNIFYING MAXIMUM CUT AND MINIMUM CUT OF A PLANAR GRAPH
    SHIH, WK
    WU, S
    KUO, YS
    IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (05) : 694 - 697
  • [3] Maximum reachability preserved graph cut
    Miao, Dongjing
    Li, Jianzhong
    Cai, Zhipeng
    THEORETICAL COMPUTER SCIENCE, 2020, 840 (840) : 187 - 198
  • [4] Graph orientation algorithms to minimize the maximum outdegree
    Asahiro, Yuichi
    Miyano, Eiji
    Ono, Hirotaka
    Zenmyo, Kouhei
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 197 - 215
  • [5] Computing the Largest Bond and the Maximum Connected Cut of a Graph
    Gabriel L. Duarte
    Hiroshi Eto
    Tesshu Hanaka
    Yasuaki Kobayashi
    Yusuke Kobayashi
    Daniel Lokshtanov
    Lehilton L. C. Pedrosa
    Rafael C. S. Schouery
    Uéverton S. Souza
    Algorithmica, 2021, 83 : 1421 - 1458
  • [6] Computing the Largest Bond and the Maximum Connected Cut of a Graph
    Duarte, Gabriel L.
    Eto, Hiroshi
    Hanaka, Tesshu
    Kobayashi, Yasuaki
    Kobayashi, Yusuke
    Lokshtanov, Daniel
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Souza, Ueverton S.
    ALGORITHMICA, 2021, 83 (05) : 1421 - 1458
  • [7] Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
    Asahiro, Yuichi
    Miyano, Eiji
    Ono, Hirotaka
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (07) : 498 - 508
  • [8] Fast Edge Orientation for Unweighted Graphs
    Bhalgat, Anand
    Hariharan, Ramesh
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 265 - +
  • [9] Reconfiguration of Steiner Trees in an Unweighted Graph
    Mizuta, Haruka
    Ito, Takehiro
    Zhou, Xiao
    Combinatorial Algorithms, 2016, 9843 : 163 - 175
  • [10] Reconfiguration of Steiner Trees in an Unweighted Graph
    Mizuta, Haruka
    Ito, Takehiro
    Zhou, Xiao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (07) : 1532 - 1540
12345