Skip to main content
SpringerLink
Log in

Studying Informational Sensitivity of Computer Algorithms

  • Conference paper
  • First Online:
Book cover Modern Trends and Techniques in Computer Science

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 285))

Abstract

This study is focused on informational sensitivity of an algorithm, defined as impact of different fixed-length inputs on the value of the algorithm’s complexity function. In addition to classic worst-case complexity this characteristic provides a supplementary tool for more detailed and more “real world” approach to studying algorithms. Statistical measure of informational sensitivity is calculated based on statistical analysis of results obtained from multiple runs of the same program implementation of the algorithm in question with random inputs. This theory is illustrated by an example of algorithm that solves the travelling salesman problem by branch and bound method using the concorde package. For a sample of different input graphs with 1,000÷10,000 vertices the statistical measurements of informational sensitivity were found and confidence ranges for complexity function were constructed. It was proven that this particular algorithm is highly sensitive to fixed-size inputs by complexity function.

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

References

  1. Ul’anov, M.: Resource-effective computer algorithms. Development and analysis (in Russian). Fizmatlit, Moscow (2008)

    Google Scholar 

  2. Petrushin, V., Ul’anov, M.: Informational sensitivity of computer algorithms (in Russian). Fizmatlit, Moscow (2012)

    Google Scholar 

  3. Knuth, D.: The Art of Computer Programming, Fundamental Algorithms, vol. 1. Addison-Wesley, Massachusetts (1997)

    Google Scholar 

  4. Gutin, G., Punnen, A.: The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  5. Appelgate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

    Google Scholar 

  6. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html

  7. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem, http://dimacs.rutgers.edu/Challenges/TSP/

Download references

Acknowledgments

The authors acknowledge Saint-Petersburg State University for a research grant 9.38.673.2013. Research was carried out using computational resources provided by Resource Center “Computer Center of SPbU” (http://cc.spbu.ru).

Author information

Authors and Affiliations

  1. Faculty of Applied Mathematics and Control Processes, Saint Petersburg State University, Universitetskii prospekt 35, 198504, Saint-Petersburg, Russia

    Anastasia Kiktenko, Mikhail Lunkovskiy & Konstantin Nikiforov

Authors
  1. Anastasia Kiktenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Lunkovskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Konstantin Nikiforov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kiktenko, A., Lunkovskiy, M., Nikiforov, K. (2014). Studying Informational Sensitivity of Computer Algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Modern Trends and Techniques in Computer Science. Advances in Intelligent Systems and Computing, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-319-06740-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06740-7_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06739-1

  • Online ISBN: 978-3-319-06740-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation