Constraint Programming and Graph Algorithms
Constraint Programming and Graph Algorithms
复制标题
约束编程和图算法
DOI：
10.1007/3-540-45022-x_48
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
K. Mehlhorn
中科院分区：
文献类型：
--
作者：
K. Mehlhorn
在99年的春季，我的同事Gert Smolka在我们的讨论中简短地介绍了GERT，他强调，寻找有效的繁殖算法会导致我在算法中引起了艰难而充满动力的问题。 J.-C. Regin介绍了“ CSP差异的过滤算法”和N. B. Guernalec和A. Colmerauer的[GC97，GC00]我（n log n）中的一个2n块”。 ，D。Duchier和J. Niehren，来自编程系统实验室的A. Koller，来自Saarlandes大学的计算机语言学系，以及SICS的Nicolas Beldiceanu [MT00，ADK+00，KMN00]和oz系统的传播器的实现（http://www.ps.uni-sb.de/oz2/）已经脱离了迄今为止的合作。
In the spring of’ 99 my colleague Gert Smolka gave me a short introduction to constraint programming. During our discussion Gert emphasized that the search for efficient propagation algorithms leads to hard and well motivated questions in algorithmics. He pointed me to the papers [Reg94] by J.-C. Regin on “A filtering algorithm for constraints of difference in CSPs” and [GC97,GC00] by N. B. Guernalec and A. Colmerauer on “Narrowing a 2n-block of sortings in O(n log n)”. I soon learned that Gert had pointed me to an extremely rich source of algorithmic problems which I am now exploring in cooperation with E. Althaus and S. Thiel from my research group, D. Duchier and J. Niehren from the programming systems lab, A. Koller from the computer linguistics department at the Universitat des Saarlandes, and with Nicolas Beldiceanu at SICS. Some papers [MT00,ADK+00,KMN00] and implementations of propagators for the Oz system (http://www.ps.uni-sb.de/oz2/) have come out of the cooperation so far.