Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2017) Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Transactions on Algorithms, 13 (4). pp. 1-36. ISSN 1549-6325

Preview

Text - Accepted Version Download (1MB) | Preview

Abstract

We show a method resulting in the improvement of several polynomial-space, exponential-time algorithms. The method capitalizes on the existence of small balanced separators for sparse graphs, which can be exploited for branching to disconnect an instance into independent components. For this algorithm design paradigm, the challenge to date has been to obtain improvements in worst-case analyses of algorithms, compared with algorithms that are analyzed with advanced methods, notably Measure and Conquer. Our contribution is the design of a general method to integrate the advantage from the separator-branching into Measure and Conquer, for a more precise and improved running time analysis

Item Type:	Article
Official URL:	https://talg.acm.org/
Additional Information:	© 2017 The Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	22 Nov 2017 15:43
Last Modified:	12 Dec 2024 01:35
URI:	http://eprints.lse.ac.uk/id/eprint/85684

Actions (login required)

View Item