Skip to main content
SpringerLink
Log in

Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction

  • Conference paper
Computer Science – Theory and Applications (CSR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3967))

Included in the following conference series:

Abstract

We consider the problem of computing shortest paths in a directed arc-weighted graph G = (V,A) in the presence of an adversary that can block (interdict), for each vertex v ∈ V, a given number p(v) of the arcs A out (v) leaving v. We show that if all arc-weights are non-negative then the single-destination version of the problem can be solved by a natural extension of Dijkstra’s algorithm in time

$$O(|A|+|V|{\rm log}|V|+\Sigma_{\upsilon\in{V}\ \backslash \{t\}}(|A_{out}(\upsilon)|-p(\upsilon)){\rm log}(p(\upsilon)+1)).$$

Our result can be viewed as a polynomial algorithm for a special case of the network interdiction problem where the adversary’s budget is node-wise limited. When the adversary can block a given number p of arcs distributed arbitrarily in the graph, the problem (p-most-vital-arcs problem) becomes NP-hard. This result is also closely related to so-called cyclic games. No polynomial algorithm computing the value of a cyclic game is known, though this problem belongs to both NP and coNP.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)

    MATH  Google Scholar 

  2. Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Operations Research Letters 8, 73–76 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes, University of Maryland, Institute of Anvanced Computer Studies, College Park, MD, Technical Report CS-TR-3539 (1995)

    Google Scholar 

  4. Beffara, E., Vorobyov, S.: Adapting Gurvich-Karzanov-Khachiyan’s algorithm for parity games: Implementation and experimentation, Technical Report 020, Department of Information Technology, Uppsala University (2001), Available at: https://www.it.uu.se/research/reports/#2001

  5. Beffara, E., Vorobyov, S.: Is randomized Gurvich-Karzanov-Khachiyan’s algorithm for parity games polynomial? Technical Report 025, Department of Information Technology, Uppsala University (2001), Available at: https://www.it.uu.se/research/reports/#2001

  6. Björklund, H., Sandberg, S., Vorobyov, S.: A Combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, DIMACS Technical Report 2004-05 (2004), Available at: http://dimacs.rutgers.edu/TechnicalReports/2004.html

  7. Corely, H.W., Shaw, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters 1, 157–160 (1982)

    Article  MathSciNet  Google Scholar 

  8. Eherenfeucht, A., Mycielski, J.: Positional games over a graph. Notices of the American Mathematical Society 20, A-334 (1973)

    Google Scholar 

  9. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory 8, 109–113 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34(3), 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  11. Fulkerson, D.R., Harding, G.C.: Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming 13, 116–118 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gallai, T.: Maximum-minimum Sätze über Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 9, 395–434 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ghare, P.M., Montgomery, D.C., Turner, T.M.: Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly 18, 37–45 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  14. Golden, B.L.: A problem in network interdiction. Naval Research Logistics Quarterly 25, 711–713 (1978)

    Article  MATH  Google Scholar 

  15. Goldschlager, L.M.: The monotone and planar circuit value problem are log space complete for P. SIGACT News 9(2), 25–29 (1977)

    Article  MATH  Google Scholar 

  16. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  17. Gurvich, V., Karzanov, A., Khachiyan, L.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Computational Mathematics and Mathematical Physics 28, 85–91 (1988)

    Article  MATH  Google Scholar 

  18. Israely, E., Wood, K.: Shortest-path network interdiction. Networks 40(2), 97–111 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  20. Karp, R.: A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Math. 23, 309–311 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  21. Karzanov, A.V., Lebedev, V.N.: Cyclical games with prohibition. Mathematical Programming 60, 277–293 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Operations Research Letters 8, 223–227 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  23. McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply networks. Naval Research Logistics Quarterly 17, 261–268 (1970)

    Article  MATH  Google Scholar 

  24. Moulin, H.: Prolongement des jeux à deux joueurs de somme nulle. Bull. Soc. Math. France, Memoire 45 (1976)

    Google Scholar 

  25. Moulin, H.: Extension of two person zero sum games. Journal of Mathematical Analysis and Apllication 55(2), 490–507 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  26. Phillips, C.A.: The network inhibition problem. In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 776–785 (1993)

    Google Scholar 

  27. Pisaruk, N.N.: Mean cost cyclical games. Mathematics of Operations Research 24(4), 817–828 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  28. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. In: Algorithms and Combinatorics, vol. 24, Springer, Heidelberg (2003)

    Google Scholar 

  29. Wagner, D.K.: Disjoint (s,t)-cuts in a network. Networks 20, 361–371 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  30. Washburn, A., Wood, K.: Two-person zero-sum games for network interdiction. Operations Research 43(2), 243–251 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  31. Wood, R.K.: Deterministic network interdiction. Mathematical and Computer Modelling 17, 1–18 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  32. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158(1-2), 343–359 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway, New Jersey, 08854, USA

    Leonid Khachiyan & Jihui Zhao

  2. RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, New Jersey, 08854, USA

    Vladimir Gurvich

Authors
  1. Leonid Khachiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Gurvich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jihui Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRMAR, Université de Rennes, Campus de Beaulieu, 35042, Rennes Cedex, France

    Dima Grigoriev

  2. Intel Corporation, JF1-13, 2111 NE 25th Avenue, 97124, Hillsboro, OR, USA

    John Harrison

  3. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St., 191023, Petersburg, Russia

    Edward A. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khachiyan, L., Gurvich, V., Zhao, J. (2006). Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_24

Download citation

  • DOI: https://doi.org/10.1007/11753728_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

  • Online ISBN: 978-3-540-34168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation