Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Maintaining Longest Paths Incrementally

  • Original Paper
  • Published:
Constraints Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Aarts, E., van Laarhoven, P., Lenstra, J., & Ulder, N. (1994). A computational study of local search algorithms for job shop scheduling. ORSA J. Comput. 6: 113–125.

    Google Scholar 

  2. Alpern, B., Carle, A., Rosen, B., Sweeney, P., & Zadeck, K. (1990). Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-90), San Francisco, California (January).

  3. Codognet, C., & Diaz, D. (2001). Yet another local search method for constraint solving. In Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA 2001), Berlin, Germany (December), pages 73–90.

  4. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artiff. Intell. 49: 61–95.

    Google Scholar 

  5. Dell’Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41: 231–252.

    MATH  Google Scholar 

  6. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34: 596–615.

    MathSciNet  Google Scholar 

  7. Di Gaspero, L., & Schaerf, A. (2002). Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using EasyLocal++. Kluwer, Boston

  8. Galinier, P., & Hao, J.-K. (2000). A general approach for constraint solving by local search. In CP-AI-OR’00, Paderborn, Germany (March).

  9. Katriel, I. (2004). Dynamic heaviest paths in DAGs with arbitrary edge weights. In CP-AI-OR’04, Springer Verlag, Nice, France (April).

  10. Katriel, I., & Bodlaender, H. L. (2005). Online topological ordering. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2005), Vancouver, Canada.

  11. Laburthe, F., & Caseau, Y. (1998). SALSA: A language for search algorithms. In CP’98, Springer Verlag, Pisa, Italy (October).

  12. Michel, L., & Van Hentenryck, P. (1992). A constraint-based architecture for local search. In OOPLSA’02, Seattle, WA (November). ACM SIGPLAN Notices, ACM Press, New York (2002).

  13. Michel, L., & Van Hentenryck, P. (2000). Localizer. Constraints 5: 41–82.

    Google Scholar 

  14. Michel, L., & Van Hentenryck, P. (2001). Localizer++: An open library for local search. Technical Report CS-01-02, Brown University.

  15. Michel, L., & Van Hentenryck, P. (2003). Maintaining longest path incrementally. In CP’03, Kinsale, Ireland (September).

  16. Michel, L., & Van Hentenryck, P. (2004). A simple tabu search for warehouse location. Eur. J. Oper. Res. 157/3: 576–591.

    Google Scholar 

  17. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6): 797–813.

    Article  MATH  Google Scholar 

  18. Ramalingam, G., & Reps, T. (1996). An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21: 267–305.

    MATH  MathSciNet  Google Scholar 

  19. Ramalingam, G., & Reps, T. (1996). On the computational complexity of dynamic graph problems. Theor. Comput. Sci. 158: 233–277.

    MATH  MathSciNet  Google Scholar 

  20. Ramalingam, G., Song, J., Joscovicz, L., & Miller, R. E. (1999). Solving difference constraints incrementally. Algorithmica 23: 261–275.

    MATH  MathSciNet  Google Scholar 

  21. Reps, T. (1982). Optimal-time incremental semantic analysis for syntax-directed editors. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages (POPL-82), ACM Press.

  22. Shaw, P., De Backer, B., & Furnon, V. (2002). Improved local search for CP toolkits. Ann. Oper. Res. 115: 31–50.

    MATH  MathSciNet  Google Scholar 

  23. Tarjan, R. (1985). Amortized computational complexity. SIAM J. Algebr. Discrete Methods 6: 306–318.

    MATH  MathSciNet  Google Scholar 

  24. Thorup, M. (2003). Integer priority queues with decrease key in constant time and the single source shortest paths problems. In Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pages 149–158.

  25. Voss, S., & Woodruff, D. (2002). Optimization Software Class Libraries. Kluwer, Boston.

    MATH  Google Scholar 

  26. Voudouris, C., Dorne, R., Lesaint, D., & Liret, A. (2001). iOpt: A software toolkit for heuristic search methods. In CP’01, Springer Verlag, Paphos, Cyprus (October).

  27. Walser, J. (1998). Integer Optimization by Local Search. Springer Verlag, Berlin

    Google Scholar 

  28. Werner, F., & Winkler, A. (1995). Insertion techniques for the heuristic solution of the job-shop problem. Discrete Appl. Math. 58(2): 191–211.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Plank-Institut für Informatik, Saarbrücken, Germany

    Irit Katriel

  2. University of Connecticut, Storrs, CT, 06269-2155, USA

    Laurent Michel

  3. Brown University, Box 1910, Providence, RI, 02912, USA

    Pascal Van Hentenryck

Authors
  1. Irit Katriel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Michel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascal Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Irit Katriel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katriel, I., Michel, L. & Van Hentenryck, P. Maintaining Longest Paths Incrementally. Constraints 10, 159–183 (2005). https://doi.org/10.1007/s10601-005-0554-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-005-0554-9

Keywords

Search

Navigation