Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction

被引：19

作者：

Krokhin, Andrei ^{[1
]}

Larose, Benoit ^{[2
]}

机构：

[1] Univ Durham, Dept Comp Sci, Durham DH1 3LE, England

[2] Concordia Univ, Dept Math & Stat, Montreal, PQ H3G 1M8, Canada

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2008年 / 22卷 / 01期

基金：

英国工程与自然科学研究理事会;

关键词：

supermodular function; lattices; optimization; tractability; constraint satisfaction;

D O I：

10.1137/060669565

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. This paper strengthens this link. We study the problem of maximizing a supermodular function which is defined on a product of n copies of a fixed finite lattice and given by an oracle. We exhibit a large class of finite lattices for which this problem can be solved in oracle-polynomial time in n. We also obtain new large classes of tractable maximum constraint satisfaction problems.

引用

页码：312 / 328

页数：17

共 50 条

[21] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Charikar, Moses
Makarychev, Konstantin
Makarychev, Yury
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
[22] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Charikar, Moses
Makarychev, Konstantin
Makarychev, Yury
[J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 62 - 68
[23] GREEDY ALGORITHMS AND SUPERMODULAR FUNCTIONS - THEORY AND APPLICATION TO A SECURITY PROBLEM IN TELECOMMUNICATION NETWORKS
BIESELGUITONNEAU, S
[J]. ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1980, 35 (7-8): : 263 - 271
[24] Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
Huang, Chien-Chung
Kakimura, Naonori
Yoshida, Yuichi
[J]. ALGORITHMICA, 2020, 82 (04) : 1006 - 1032
[25] Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
Chien-Chung Huang
Naonori Kakimura
Yuichi Yoshida
[J]. Algorithmica, 2020, 82 : 1006 - 1032
[26] Research on product configuration framework based on distributed constraint satisfaction
School of Mechanical Engineering and Automation, Northeastern University, Shenyang 110004, China
不详
[J]. Dongbei Daxue Xuebao, 2007, 1 (103-106):
[27] Green product configuration design based on constraint satisfaction problems
School of Mechanical and Automotive Engineering, Hefei University of Technology, Hefei 230009, China
[J]. Jixie Gongcheng Xuebao, 1600, 19 (117-124):
[28] Modelling and solving engineering product configuration problems by constraint satisfaction
Xie, H
Henderson, P
Kernahan, M
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (20) : 4455 - 4469
[29] Counting, structure identification and maximum consistency for binary constraint satisfaction problems
Istrate, G
[J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97, 1997, 1330 : 136 - 149
[30] Realization of Logic Functions Using Switching Lattices Under a Delay Constraint
Aksoy, Levent
Akkan, Nihat
Sedef, Herman
Altun, Mustafa
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2021, 40 (10) : 2036 - 2048

← 1 2 3 4 5 →