A primal-dual approximation algorithm for MINSAT

被引：0

作者：

Arif, Umair ^{[1
]}

Benkoczi, Robert ^{[1
]}

Gaur, Daya Ram ^{[1
]}

Krishnamurti, Ramesh ^{[2
]}

机构：

[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB, Canada

[2] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada

来源：

DISCRETE APPLIED MATHEMATICS | 2022年 / 319卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Primal-dual schema; Minimum satisfiability; VERTEX COVER; SET; GRAPHS;

D O I：

10.1016/j.dam.2021.07.016

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We characterize the optimal solution to the linear programming relaxation of the standard formulation for the minimum satisfiability problem. We give a O(nm(2)) combi-natorial algorithm to solve the fractional version of the minimum satisfiability problem optimally where n(m) is the number of variables (clauses). As a by-product, we obtain a 2(1 - 1/2(k)) approximation algorithm for the minimum satisfiability problem where k is the maximum number of literals in any clause. (c) 2021 Elsevier B.V. All rights reserved.

引用

页码：372 / 381

页数：10

共 50 条

[1] Proximal primal-dual best approximation algorithm with memory
Bednarczuk, E. M.
Jezierska, A.
Rutkowski, K. E.
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 71 (03) : 767 - 794
[2] A PRIMAL-DUAL APPROXIMATION ALGORITHM FOR THE STEINER FOREST PROBLEM
RAVI, R
[J]. INFORMATION PROCESSING LETTERS, 1994, 50 (04) : 185 - 190
[3] PRIMAL-DUAL APPROXIMATION ALGORITHM FOR GENERALIZED STEINER NETWORK PROBLEMS
WILLIAMSON, DP
GOEMANS, MX
MIHAIL, M
VAZIRANI, VV
[J]. COMBINATORICA, 1995, 15 (03) : 435 - 454
[4] A PRIMAL-DUAL ALGORITHM FOR BSDES
Bender, Christian
Schweizer, Nikolaus
Zhuo, Jia
[J]. MATHEMATICAL FINANCE, 2017, 27 (03) : 866 - 901
[5] The primal-dual method for approximation algorithms
Williamson, DP
[J]. MATHEMATICAL PROGRAMMING, 2002, 91 (03) : 447 - 478
[6] The primal-dual method for approximation algorithms
David P. Williamson
[J]. Mathematical Programming, 2002, 91 : 447 - 478
[7] A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Zhao, L
Nagamochi, H
Ibaraki, T
[J]. DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 275 - 289
[8] A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
Donglei Du
Ruixing Lu
Dachuan Xu
[J]. Algorithmica, 2012, 63 : 191 - 200
[9] A primal-dual schema based approximation algorithm for the element connectivity problem
Jain, K
Mandoiu, I
Vazirani, VV
Williamson, DP
[J]. PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 484 - 489
[10] Improved primal-dual approximation algorithm for the Connected Facility Location problem
Jung, Hyunwoo
Hasan, Mohammad Khairul
Chwa, Kyung-Yong
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 265 - 277

← 1 2 3 4 5 →