Skip to main content
SpringerLink
Log in

COCA: Combining Speedup Techniques Based on Containers and Arc-Flags

  • Conference paper
Trends in Network and Communications (WeST 2011, NeCoM 2011, WiMoN 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 197))

Abstract

The Dijkstra’s algorithm [1] is applied on many real world network problems like mobile routing, road maps, railway networks, etc,. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. The main focus of this work is to implement the combined speedup technique which is based on containers and arc flags(COCA). The technique is experimented with two different types of LEDA generated graphs namely random graphs, planar graphs and road networks. The performance metric speedup was measured with respect to runtime of the technique and vertex visited during shortest path computation. The COCA technique proves to give best results in planar graphs. Road networks can be effectively processed with shortest path containers

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Schulz, F., Wagner, D., Weihe, K.: “Dijkstra’s algorithm on-line: An empirical case study from public railroad transport”. ACM Journal of Experimental Algorithmics 5, 12 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005)

    Google Scholar 

  4. Holzer, M., Schulz, F., Wagner, D., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. ACM Journal of Experimental Algorithmics 10, Article No. 2.5 (2005)

    Google Scholar 

  5. Wagner, D., Willhalm, T.: Speed-Up Techniques for Shortest-Path Computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 23–36. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Phol, I.: Bi-directional Search. Machine Intelligence 6, 124–140 (1971)

    Google Scholar 

  7. Holzer, M., Schulz, F., Wagner, D.: Engineering Multilevel Overlay Graphs for Shortest-Path Queries. ACM Journal of Experimental Algorithmics 13, Article No. 2.5 (September 2008)

    Google Scholar 

  8. Holzer, M.: Hierarchical speedup techniques for shortest path algorithms., M, Tech. report, Dept of Informatics, University of Konstanz, Germany (2003)

    Google Scholar 

  9. Schulz, F., Wagner, D., Zaroliagis, C.: Using multi-level graphs for timetable information in railway systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 43–59. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics 10(1.3) (2005)

    Google Scholar 

  11. Mohring, R.H., Schilling, H., Schutz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra’s algorithm. ACM Journal of Experimental Algorithmics 11, Article No. 2.8, 1–29 (2006)

    MathSciNet  MATH  Google Scholar 

  12. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM Journal of Experimental Algorithmics 15, Article No. 3 (2010)

    Google Scholar 

  13. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303–318. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. LEDA, http://www.algorithmic-solutions.com

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Pondicherry Engineering College, Pondicherry, India

    Kalpana Ramanujam

  2. Perunthalaivar Kamarajar Institute of Engineering & Technology, Karaikal, Pondicherry, India

    Thambidurai Perumal

Authors
  1. Kalpana Ramanujam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thambidurai Perumal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Southeastern Louisiana University, 70402, Hammond, LA, USA

    David C. Wyld

  2. Chair of Systems and Computer Networks, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Michal Wozniak

  3. University of Calcutta, Calcutta, India

    Nabendu Chaki

  4. Jackson State University, 39217, Jackson, MS, USA

    Natarajan Meghanathan

  5. Wireilla Net Solutions PTY Ltd, Melbourne, Victoria, Australia

    Dhinaharan Nagamalai

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramanujam, K., Perumal, T. (2011). COCA: Combining Speedup Techniques Based on Containers and Arc-Flags. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Trends in Network and Communications. WeST NeCoM WiMoN 2011 2011 2011. Communications in Computer and Information Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22543-7_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22543-7_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22542-0

  • Online ISBN: 978-3-642-22543-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation