Sciweavers

CPAIOR
2004
Springer

O(n log n) Filtering Algorithms for Unary Resource Constraint

14 years 4 months ago
O(n log n) Filtering Algorithms for Unary Resource Constraint
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: notfirst/not-last and propagation of detectable precedences. These two algorithms can be used together with edge-finding to further improve the filtering. This paper also propose new O(n log n) implementation of fail detection (overload checking).
Petr Vilím
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CPAIOR
Authors Petr Vilím
Comments (0)