Abstract
In this chapter we discuss several algorithms based on the following approach. There is a number of efficient algorithms for many problems in P. To apply these algorithms on hard problems, we (exponentially) enlarge the size of a hard problem and apply fast polynomial time algorithm on an input of exponential size. The common way to enlarge the problem is to split the input into parts, and for each part to enumerate (or list) all possible solutions to subproblems corresponding to the part. Then we combine solutions of subproblems to solutions of the input of the original problem by making use of a fast polynomial time algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schroeppel, R., Shamir, A.: A T = O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456–464 (1981)
Williams, R.: Algorithms and resource requirements for fundamental problems. Ph.D. thesis, Carnegie Mellon University (2007)
Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21, 277–292 (1974)
Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010), Lecture Notes in Comput. Sci., vol. 6110, pp. 235–256. Springer (2010)
Fomin, F.V., Golovach, P.A., Kratochvíl, J., Kratsch, D., Liedloff, M.: Sort and search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14), 795–798 (2009)
Klinz, B.,Woeginger, G.J.: Faster algorithms for computing power indices in weighted voting games. Math. Social Sci. 49(1), 111–116 (2005).
Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comp. Sci. 348(2-3), 357–365 (2005)
Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carolin. 26(2), 415–419 (1985)
Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3), 57–67 (2004)
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354–356 (1969)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3), 251–280 (1990)
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). Split and List. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_9
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)