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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ul’anov, M.: Resource-effective computer algorithms. Development and analysis (in Russian). Fizmatlit, Moscow (2008)
Petrushin, V., Ul’anov, M.: Informational sensitivity of computer algorithms (in Russian). Fizmatlit, Moscow (2012)
Knuth, D.: The Art of Computer Programming, Fundamental Algorithms, vol. 1. Addison-Wesley, Massachusetts (1997)
Gutin, G., Punnen, A.: The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht (2004)
Appelgate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html
8th DIMACS Implementation Challenge: The Traveling Salesman Problem, http://dimacs.rutgers.edu/Challenges/TSP/
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
Editor information
Editors and Affiliations
Rights 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)