Branching and treewidth based exact algorithms

Authors:
Fedor V. Fomin;Serge Gaspers;Saket Saurabh
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;The Institute of Mathematical Sciences, Chennai, India
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 9
Cited 5

On generating all maximal independent sets

Information Processing Letters
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
An algorithm for counting maximum weighted independent sets and its applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Counting models for 2SAT and 3SAT formulae

Theoretical Computer Science
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

Theory of Computing Systems
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
Algorithms based on the treewidth of sparse graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Improved approximation bounds for edge dominating set in dense graphs

Theoretical Computer Science
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Exact algorithms for edge domination

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Practical computation of optimal schedules in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Counting minimum weighted dominating sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of exact (exponential time) algorithms for NP hard problems. In this paper we discuss the efficiency of simple algorithms based on combinations of these techniques. We give several examples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard problems: Minimum Maximal Matching and some variations, counting the number of maximum weighted independent sets. We also briefly discuss how similar techniques can be used to design parameterized algorithms. As an example, we give fastest known algorithm solving k-Weighted Vertex Cover problem.