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 条
  • [31] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
    Huang, Chien-Chung
    Kakimura, Naonori
    [J]. ALGORITHMICA, 2021, 83 (03) : 879 - 902
  • [32] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
    Chien-Chung Huang
    Naonori Kakimura
    [J]. Algorithmica, 2021, 83 : 879 - 902
  • [33] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
    Huang, Chien-Chung
    Kakimura, Naonori
    [J]. ALGORITHMS AND DATA STRUCTURES, WADS 2019, 2019, 11646 : 438 - 451
  • [34] Maximizing h-hop Independently Submodular Functions Under Connectivity Constraint
    Xu, Wenzheng
    Peng, Dezhong
    Liang, Weifa
    Jia, Xiaohua
    Xu, Zichuan
    Zhou, Pan
    Wu, Weigang
    Chen, Xiang
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1099 - 1108
  • [35] Self-adaptivity for constraint satisfaction: Learning penalty functions
    Eiben, AE
    Ruttkay, Z
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 258 - 261
  • [36] Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks
    Kuo, Tung-Wei
    Lin, Kate Ching-Ju
    Tsai, Ming-Jer
    [J]. 2013 PROCEEDINGS IEEE INFOCOM, 2013, : 1977 - 1985
  • [37] Application driven inverse type constraint satisfaction problems
    Zhuravlev Y.I.
    Aslanyan L.
    Ryazanov V.V.
    Sahakyan H.
    [J]. Aslanyan, L. (lasl@sci.am), 1600, Izdatel'stvo Nauka (27): : 418 - 425
  • [38] Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks
    Kuo, Tung-Wei
    Lin, Kate Ching-Ju
    Tsai, Ming-Jer
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (02) : 533 - 546
  • [39] Constraint satisfaction in "conscious" software agents - A practical application
    Kelemen, A
    Franklin, S
    Liang, YL
    [J]. APPLIED ARTIFICIAL INTELLIGENCE, 2005, 19 (05) : 491 - 514
  • [40] The Application of Constraint Satisfaction Technique in Conflict Detection and Resolution
    谢洪潮
    [J]. High Technology Letters, 2002, (03) : 88 - 91
12345