Abstract
In this introductory chapter we start with a preliminary part and present then two classical exact algorithms breaking the triviality barrier. The first one, from the nineteen sixties, is the dynamic programming algorithm of Bellman, Held and Karp to solve the Travelling Salesman problem [16, 17, 111]. The second is a branching algorithm to compute a maximum independent set of a graph. The main idea of this algorithm can be traced back to the work of Miller and Muller [155] and Moon and Moser [161] from the nineteen sixties.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
- Travel Salesman Problem
- Travel Salesman Problem
- Dynamic Programming Algorithm
- Polynomial Space
- Input Length
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bellman, R.: Combinatorial processes and dynamic programming. In: Proc. Sympos. Appl. Math., Vol. 10, pp. 217–249. American Mathematical Society, Providence, R.I. (1960)
Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM 10, 196–210 (1962)
Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets. IBM Research Rep. RC-240, J.T. Watson Research Center, Yorktown Heights, New York, USA (1960)
Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)
Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537–546 (1977)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer-Verlag, New York (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin (2006)
Niedermeier, R.: Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
Hoffman, A.J., Wolfe, P.: History. In: The traveling salesman problem: A guided tour of combinatorial optimization, Wiley-Intersci. Ser. Discrete Math., pp. 1–15. Wiley, Chichester (1985)
Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49–51 (1982)
Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of 42th ACM Symposium on Theory of Computing (STOC 2010), pp. 321–330. ACM (2010)
Cormen, T.H., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, second edn. The MIT Press, Cambridge, Mass. (2001)
Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill (2008)
Schönhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7, 281–292 (1971)
Förer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979–1005 (2009).
Gupta, S., Raman, V., Saurabh, S.: Fast exponential algorithms for maximum r-regular induced subgraph problems. In: Proceedings of the 26th International Conference Foundations of Software Technology and Theoretical Computer Science, (FSTTCS 2006), Lecture Notes in Comput. Sci., pp. 139–151. Springer (2006)
Jian, T.: An O(20.304n) algorithm for solving maximum independent set problem. IEEE Trans. Computers 35(9), 847–851 (1986)
Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425–440 (1986)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: A simple O(20.288n) independent set algorithm. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 18–25. SIAM (2006)
Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), Leibniz International Proceedings in Informatics (LIPIcs), vol. 4, pp. 287–298. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2009).
Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: A bottom-up method and fast algorithms for max independent set. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), Lecture Notes in Comput. Sci., vol. 6139, pp. 62–73. Springer (2010)
Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 856–857. SIAM (1999)
Bourgeois, N., Escoffier, B., Paschos, V.T.: An O*(1.0977n) exact algorithm for max independent set in sparse graphs. In: Proceedings of the 3rd Workshop on Parameterized and Exact Computation (IWPEC 2008), Lecture Notes in Comput. Sci., vol. 5018, pp. 55–65. Springer (2008)
Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Maximum independent set in graphs of average degree at most three in O(1.08537n) average degree. In: Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Lecture Notes in Comput. Sci., vol. 6108, pp. 373–384. Springer (2010)
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41(2), 280–301 (2001)
Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Algorithmica 43(4), 245–273 (2005)
Förer, M.: A faster algorithm for finding maximum independent sets in sparse graphs. In: Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Lecture Notes in Comput. Sci., vol. 3887, pp. 491–501. Springer (2006)
Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. Discrete Algorithms 7(2), 191–212 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fomin, F.V., Kratsch, D. (2010). Introduction. In: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16533-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16532-0
Online ISBN: 978-3-642-16533-7
eBook Packages: Computer ScienceComputer Science (R0)