Predicate Detection to Solve Combinatorial Optimization Problems
Predicate Detection to Solve Combinatorial Optimization Problems
复制标题
谓词检测解决组合优化问题
DOI:
10.1145/3350755.3400235
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Garg, Vijay K.
中科院分区:
文献类型:
--
作者:
Garg, Vijay K.
We present a method to design parallel algorithms for constrained combinatorial optimization problems. Our method solves and generalizes many classical combinatorial optimization problems including the stable marriage problem, the shortest path problem and the market clearing price problem. These three problems are solved in the literature using Gale-Shapley algorithm, Dijkstra's algorithm, and Demange, Gale, Sotomayor algorithm. Our method solves all these problems by casting them as searching for an element that satisfies an appropriate predicate in a distributive lattice. Moreover, it solves generalizations of all these problems --- namely finding the optimal solution satisfying additional constraints called lattice-linear predicates. For stable marriage problems, an example of such a constraint is that Peter's regret is less than that of Paul. For shortest path problems, an example of such a constraint is that cost of reaching vertex v1is at least the cost of reaching vertex v2. For the market clearing price problem, an example of such a constraint is that item1is priced at least as much as item2. Our algorithm, called Lattice-Linear Predicate Detection (LLP) can be implemented in parallel without any locks or compare-and-set instructions. It just assumes atomicity of reads and writes.
DOI:
--
发表时间:
2020
期刊:
影响因子:
--
作者:
折田 充;小林 景;村里 泰昭;吉井 誠;Richard Lavin;相澤 一美;Ryoko Oishi-Tomiyasu;富安 (大石) 亮子
通讯作者:
富安 (大石) 亮子
影响因子:
1.1
作者:
Vânia M. F. Dias;G. D. D. Fonseca;C. M. Figueiredo;J. Szwarcfiter
通讯作者:
J. Szwarcfiter