What is an algorithm? An algorithm is a procedure to accomplish a specific task. An algorithm is the idea behind any reasonable computer program.
To be interesting, an algorithm must solve a general, well-specifiedem problem. An algorithmic problem is specified by describing the complete set of instances it must work on and of its output after running on one of these instances. This distinction, between a problem and an instance of a problem, is fundamental.
KeywordsAlgorithm Design Travel Salesman Problem Travel Salesman Problem Summation Formula Input Instance
Unable to display preview. Download preview PDF.
- [Bro95]F. Brooks. The Mythical Man-Month. Addison-Wesley, Reading MA, 20th anniversary edition, 1995.Google Scholar
- [Gol04]M. Golumbic. Algorithmic Graph Theory and Perfect Graphs, volume 57 of Annals of Discrete Mathematics. North Holland, second edition, 2004.Google Scholar
- [Gri89]D. Gries. The Science of Programming. Springer-Verlag, 1989.Google Scholar
- [KT06]J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2006.Google Scholar
- [Raw92]G. Rawlins. Compared to What? Computer Science Press, New York, 1992.Google Scholar
- [YS96]F. Younas and S. Skiena. Randomized algorithms for identifying minimal lottery ticket sets. Journal of Undergraduate Research, 2-2:88–97, 1996.Google Scholar