On Approximate Constraint Satisfaction

被引：0
|
作者：
Chentsov, A. G. [1 ]
机构：
[1] Russian Acad Sci, Ural Branch, Inst Math & Mech, Ul S Kovalevskoi 16, Ekaterinburg 620219, Russia
来源：
RUSSIAN MATHEMATICS | 2011年 / 55卷 / 02期
基金：
俄罗斯基础研究基金会;
关键词：
bitopological space; finitely additive measure; extension;
D O I：
10.3103/S1066369X11020095
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We consider an abstract problem on fulfilling asymptotic constraints. We propose a very general approach to constructing "nonsequential" attraction sets in the space of generalized elements formalizable as finitely additive measures. We study the existence and the structure of the asymptote universal in the range of "asymptotic constraints" not requiring the compactifiability of the space of ordinary solutions.
引用
收藏
页码：75 / 89
页数：15
相关论文
共 50 条
  • [1] Approximate constraint satisfaction over a constraint hierarchy: A preliminary study
    Ryu, YU
    [J]. PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL V: MODELING TECHNOLOGIES AND INTELLIGENT SYSTEMS TRACK, 1998, : 134 - 141
  • [2] Approximate Constraint Satisfaction Requires Large LP Relaxations
    Chan, Siu On
    Lee, James R.
    Raghavendra, Prasad
    Steurer, David
    [J]. 2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 350 - 359
  • [3] Approximate Constraint Satisfaction Requires Large LP Relaxations
    Chan, Siu On
    Lee, James R.
    Raghavendra, Prasad
    Steurer, David
    [J]. JOURNAL OF THE ACM, 2016, 63 (04)
  • [4] Optimal Approximate Algorithm for Reoptimization of Strict Constraint Satisfaction Problems
    Mikhailyuk, V. A.
    [J]. JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2012, 44 (11) : 45 - 54
  • [5] Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
    Yamakami, Tomoyuki
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 261 - 272
  • [6] A Group Travel Recommender System Based on Group Approximate Constraint Satisfaction
    Kyeong Kim, Jae
    Cheul Kwon, Woo
    Choi, Il Young
    Heo, Hyuk
    Moon, Hyun Sil
    [J]. IEEE ACCESS, 2024, 12 : 96113 - 96125
  • [7] Approximate counting for complex-weighted Boolean constraint satisfaction problems
    Yamakami, Tomoyuki
    [J]. INFORMATION AND COMPUTATION, 2012, 219 : 17 - 38
  • [8] Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
    Caragiannis, Ioannis
    Fanelli, Angelo
    Gravin, Nick
    [J]. ALGORITHMICA, 2017, 77 (04) : 1143 - 1158
  • [9] Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
    Ioannis Caragiannis
    Angelo Fanelli
    Nick Gravin
    [J]. Algorithmica, 2017, 77 : 1143 - 1158
  • [10] Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
    [J]. Caragiannis, Ioannis, 1600, Springer Verlag (8768):
12345