Abstract
In this chapter we collect several unrelated results. The algorithm solving the Bandwidth Minimization problem can be seen as a combination of the branching and the dynamic programming techniques. The second section on Branch & Recharge provides a new angle on branching algorithms. The third section gives a brief overview of fundamental results by Impagliazzo, Paturi, and Zane, and the Exponential Time Hypothesis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fomin, F.V., Golovach, P.A., Kratochvíl, J., Kratsch, D., Liedloff, M.: Branch and recharge: Exact algorithms for generalized domination. In: Proceedings of the 10th Workshop on Algorithms and Data Structures, (WADS 2007), Lecture Notes in Comput. Sci., vol. 4619, pp. 507–518. Springer (2007)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. System Sci. 63(4), 512–530 (2001)
Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)
Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000), Lecture Notes in Comput. Sci., vol. 1851, pp. 10–19. Springer (2000)
Cygan, M., Pilipczuk, M.: Faster exact bandwidth. In: Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Lecture Notes in Comput. Sci., vol. 5344, pp. 101–109. Springer (2008)
Fomin, F.V., Lokshtanov, D., Saurabh, S.: An exact algorithm for minimum distortion embedding. In: Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Lecture Notes in Comput. Sci., vol. 5911, pp. 112–121. Springer (2009)
Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Lecture Notes in Comput. Sci., vol. 5555, pp. 304–315. Springer (2009)
Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing 1, 157–171 (1994)
Stearns, R.E., Hunt III, H.B.: Power indices and easier hard problems. Math. Systems Theory 23(4), 209–225 (1990).
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. System Sci. 62(2), 367–375 (2001).
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin (2006)
Johnson, D.S., Szegedy, M.: What are the least tractable instances of max independent set? In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 927–928. SIAM (1999)
Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006) pp. 252–260 (2006).
Pătraşcu, M., Williams, R.: On the possibility of faster SAT algorithms. In: Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1065–1075. SIAM (2010)
Dantsin, E., Hirsch, E.A.:Worst-case upper bounds. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, chap. 12, pp. 403–424. IOS Press (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). Miscellaneous. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_11
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)