Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set

11/28/2017
by   Mahdi Belbasi, et al.
0

An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would result in an exponential space algorithm, but we use zeta transforms to obtain a polynomial space algorithm in exchange for a moderate increase of the time. This framework was pioneered by Lokshtanov and Nederlof 2010 and adapted to a dynamic setting by Fürer and Yu 2017. Our space-efficient algorithm is a parametrized algorithm based on tree-depth and treewidth. The naive algorithm for Minimum Dominating Set runs in O^*(2^n) time. Most of the previous works have focused on time complexity. But space optimization is a crucial aspect of algorithm design, since in several scenarios space is a more valuable resource than time. Our parametrized algorithm runs in O^*(3^d), and its space complexity is O(nk), where d is the depth and k is the width of the given tree decomposition. We observe that Reed's 1992 algorithm constructing a tree decomposition of a graph uses only polynomial space. So, even if the tree decomposition is not given, we still obtain an efficient polynomial space algorithm. There are some other algorithms which use polynomial space for this problem, but they are not efficient for graphs with small tree depth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Dynamic programming on various graph decompositions is one of the most f...
research
01/21/2019

A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation

An NP-hard graph problem may be intractable for general graphs but it co...
research
09/17/2019

A heuristic use of dynamic programming to upperbound treewidth

For a graph G, let Ω(G) denote the set of all potential maximal cliques ...
research
01/15/2020

Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...
research
03/27/2013

Minimum Error Tree Decomposition

This paper describes a generalization of previous methods for constructi...
research
06/28/2021

The Reward-Penalty-Selection Problem

The Set Cover Problem (SCP) and the Hitting Set Problem (HSP) are well-s...
research
10/06/2012

D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming

In this work, we propose Answer-Set Programming (ASP) as a tool for rapi...

Please sign up or login with your details

Forgot password? Click here to reset