Abstract
We prove that given a graph, one can efficiently find a set of no more than m/5.217 + 1 nodes whose removal yields a partial two-tree. As an application, we immediately get simple algorithms for several problems, including Max-Cut, Max-2-SAT and Max-2-XSAT. All of these take a record-breaking time of O *(2m/5.217), where m is the number of clauses or edges, while only using polynomial space. Moreover, the existence of the aforementioned node sets implies an upper bound of m/5.217 + 3 on the treewidth of a graph with m edges. Letting go of polynomial space restrictions, this can be improved to a bound of m/5.769 + O(log n) on the pathwidth, leading to algorithms for the above problems that take O *(2m/5.769) time.
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
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia (1999)
Chen, J., Kanj, I.A.: Improved exact algorithms for Max-Sat. Discrete Applied Mathematics 142(1–3), 17–27 (2004)
Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen (May 2005)
Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245–256. Springer, Heidelberg (2004)
Gramm, J., Hirsch, E.A., Niedermeier, R., Rossmanith, P.: New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Discrete Applied Mathematics 130(2), 139–155 (2003)
Madsen, B.A., Rossmanith, P.: Maximum exact satisfiability: NP-completeness proofs and exact algorithms. Technical Report RS-04-19, BRICS (October 2004)
Scott, A., Sorkin, G.B.: Faster algorithms for Max-CUT and Max-CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 382–395. Springer, Heidelberg (2003)
Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10(4), 529–550 (1997)
Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1227–1237. Springer, Heidelberg (2004)
Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kneis, J., Mölle, D., Richter, S., Rossmanith, P. (2005). Algorithms Based on the Treewidth of Sparse Graphs. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_34
Download citation
DOI: https://doi.org/10.1007/11604686_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)