Kurt Mehlhorn, Sven Thiel  Home/Search
Context Related
| mpisb.mpg.de/~sth...edness_paper.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~sthiel/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present narrowing algorithms for the sortedness and the alldifferent constraint which achieve bound-consistency. The algorithm for the sortedness constraint takes as input 2n intervals X1 , ..., Xn , Y1 , ..., Yn from a linearly ordered set D. Let S denote the set of all tuples t 2 X1 Xn Y1 Yn such that the last n components of t are obtained by sorting the first n components. Our algorithm determines whether S is non-empty and if so reduces the intervals to... (Update)
Cited by: More
The alldifferent Constraint: A Survey - van Hoeve (2001) (Correct)
Simultaneous Matchings - Elbassioni, Katriel, Kutz, Mahajan (Correct)
Constraint Programming and Graph Algorithms - Kurt Mehlhorn Max-Planck-Institut (2000) (Correct)
Active bibliography (related documents): More All
0.5: JACK: A Java Constraint Kit - Abdennadher, Krämer, Saft, Schmauss (2001) (Correct)
0.3: Augment or Push? A computational study of.. - Cherkassky.. (1998) (Correct)
0.3: Cost-Filtering Algorithms for the two Sides of the Sum of.. - Beldiceanu, al. (2002) (Correct)
Similar documents based on text: More All
0.4: Integer Programming Models 1: Selected Models - Kalvelagen (2001) (Correct)
0.4: A Fast and Simple Algorithm for Bounds Consistency .. - Lopez-Ortiz.. (2003) (Correct)
0.3: Fast Bound Consistency for the Global Cardinality Constraint - Katriel, Thiel (2003) (Correct)
Related documents from co-citation: More All
8: A fast algorithm for the bound consistency of alldi# constraints (context) - Puget - 1998
7: A Linear-Time Algorithm for a Special Case of Disjoint Set Union (context) - Gabow, Tarjan - 1985
6: A bounds-based reduction scheme for constraints of di#erence (context) - Leconte - 1996
BibTeX entry: (Update)
K. Mehlhorn and S. Thiel. Faster algorithms for bound-consistency of the sortedness and alldifferent constraint. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 306--319, Singapore, September 2000. http://citeseer.ist.psu.edu/mehlhorn00faster.html More
@inproceedings{ mehlhorn00faster,
author = "Kurt Mehlhorn and Sven Thiel",
title = "Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint",
booktitle = "Principles and Practice of Constraint Programming",
pages = "306--319",
year = "2000",
url = "citeseer.ist.psu.edu/mehlhorn00faster.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
375 LEDA: a platform for combinatorial and geometric computing - Mehlhorn, aher - 1999
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1983
15 Maximum matchings in a convex bipartite graph (context) - Glover - 1967
5 Lecture Notes in Computer Science (context) - Bleuzen-Guernalec, Colmerauer et al. - 1997
3 Algorithms for dense graphs and networks on the random acces.. (context) - Cheriyan, Mehlhorn - 1996
2 A ltering algorithm for constraints of di erence in CSPs (context) - Regin - 1994
2 Optimal narrowing of a block of sortings in optimal time (context) - Bleuzen-Guernalec, Colmerauer - 2000
1 A fast algorithm for the bound consistency of alldi constra.. (context) - cois - 1998
http://www.mozart-oz.org
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~sthiel/): More
The Pairing Constraint for Round Robin Tournament Scheduling - Henz, Müller, Tan, Thiel (Correct)
An Efficient Algorithm for the Configuration.. - Althaus, Duchier, .. (Correct)
Fast Bound Consistency for the Global Cardinality Constraint - Katriel, Thiel (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC