Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Artificial Intelligence - Special issue on knowledge representation
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
Insertion techniques for the heuristic solution of the job shop problem
Proceedings of the workshop on Discrete algorithms
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
A fast taboo search algorithm for the job shop problem
Management Science
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Optimal-time incremental semantic analysis for syntax-directed editors
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Constraints
Yet Another Local Search Method for Constraint Solving
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
iOpt: A Software Toolkit for Heuristic Search Methods
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
A dynamic topological sort algorithm for directed acyclic graphs
Journal of Experimental Algorithmics (JEA)
High-Performance Local Search for Task Scheduling with Human Resource Allocation
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
| Hi-index | 0.00 |
Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. This paper considers invariants for longest paths in directed acyclic graphs, a fundamental abstraction for many applications. It presents bounded incremental algorithms for arc insertion and deletion which run in O(驴驴驴 + |驴| log|驴|) time and O(驴驴驴) time respectively, where |驴| and 驴驴驴 are measures of the change in the input and output. The paper also shows how to generalize the algorithm to various classes of multiple insertions/deletions encountered in scheduling applications. Preliminary experimental results show that the algorithms behave well in practice.