Computer Science – Data Structures and Algorithms
Scientific paper
2008-02-20
Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (
Computer Science
Data Structures and Algorithms
Scientific paper
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a tool in the design of algorithms. In an iterative process, we can obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with measure and conquer results in a quasiconvex programming problem. The solution by computer to this problem not only gives a bound on the running time, but also can give a new reduction rule, thus giving a new, possibly faster algorithm. This makes design by measure and conquer a form of computer aided algorithm design. When we apply the methodology to a Set Cover modelling of the Dominating Set problem, we obtain the currently fastest known exact algorithms for Dominating Set: an algorithm that uses $O(1.5134^n)$ time and polynomial space, and an algorithm that uses $O(1.5063^n)$ time.
Bodlaender Hans L.
van Rooij Johan M. M.
No associations
LandOfFree
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-647745