Complexity of the max cut Problem with the Minimal Domination Constraint

被引：0
|
作者：
Voroshilov V.V. [1 ]
机构：
[1] Dostoevsky Omsk State University, Omsk
来源：
Journal of Applied and Industrial Mathematics | 2022年 / 16卷 / 01期
关键词：
approximation; cutset; dominating set; graph; optimization problem; weighted graph;
D O I：
10.1134/S1990478922010161
中图分类号：
学科分类号：
摘要：
Abstract: Let (Formula presented.)be a simple weighted undirected graph with nonnegative edge weights. LetD be a minimal dominating set in G. The cutset induced by D is the set of edges with one vertex in the set D and the other in (Formula presented.). The weight of the cutset is the total weight of all its edges. The paper dealswith the problem of finding a cutset with the maximum weight among all minimal dominatingsets. In particular, the nonexistence of a polynomial approximation algorithm with a ratio betterthan (Formula presented.) in the case of (Formula presented.) is proved. © 2022, Pleiades Publishing, Ltd.
引用
收藏
页码：168 / 174
页数：6
相关论文
共 50 条
  • [1] On the Minimal Constraint Satisfaction Problem: Complexity and Generation
    Escamocher, Guillaume
    O'Sullivan, Barry
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 731 - 745
  • [2] The Complexity of Minimal Inference Problem for Conservative Constraint Languages
    Wrona, Michal
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019, 20 (02)
  • [3] The Complexity of Minimal Inference Problem for Conservative Constraint Languages
    Wrona, Michal
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [4] Complexity and heuristics for the weighted max cut-clique problem
    Bourel, Mathias
    Canale, Eduardo
    Robledo, Franco
    Romero, Pablo
    Stabile, Luis
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (02) : 908 - 928
  • [5] Complexity results for the gap inequalities for the max-cut problem
    Galli, Laura
    Kaparis, Konstantinos
    Letchford, Adam N.
    OPERATIONS RESEARCH LETTERS, 2012, 40 (03) : 149 - 152
  • [6] Complexity of the game domination problem
    Bresar, Bostjan
    Dorbec, Paul
    Klavzar, Sandi
    Kosmrlj, Gasper
    Renault, Gabriel
    THEORETICAL COMPUTER SCIENCE, 2016, 648 : 1 - 7
  • [7] Quantum Complexity for Vector Domination Problem
    Ambainis, Andris
    Zvirbulis, Ansis
    SOFSEM 2023: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2023, 13878 : 328 - 341
  • [8] On the complexity of the labeled domination problem in graphs
    Argiroffo, Gabriela
    Leoni, Valeria
    Torres, Pablo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 355 - 367
  • [9] THE COMPLEXITY OF SECURE DOMINATION PROBLEM IN GRAPHS
    Wang, Haichao
    Zhao, Yancai
    Deng, Yunping
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (02) : 385 - 396
  • [10] Complexity of the paired domination subdivision problem
    Amjadi, Jafar
    Chellali, Mustapha
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2022, 7 (02) : 177 - 182
12345