Lower Bounds on Dynamic Programming for Maximum Weight Independent Set

02/13/2021
by   Tuukka Korhonen, et al.
0

We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWIS). We model such algorithms as tropical circuits, i.e., circuits that compute with max and + operations. For a graph G, an MWIS-circuit of G is a tropical circuit whose inputs correspond to vertices of G and which computes the weight of a maximum weight independent set of G for any assignment of weights to the inputs. We show that if G has treewidth w and maximum degree d, then any MWIS-circuit of G has 2^Ω(w/d) gates and that if G is planar, or more generally H-minor-free for any fixed graph H, then any MWIS-circuit of G has 2^Ω(w) gates. An MWIS-formula is an MWIS-circuit where each gate has fan-out at most one. We show that if G has treedepth t and maximum degree d, then any MWIS-formula of G has 2^Ω(t/d) gates. It follows that treewidth characterizes optimal MWIS-circuits up to polynomials for all bounded degree graphs and H-minor-free graphs, and treedepth characterizes optimal MWIS-formulas up to polynomials for all bounded degree graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2020

Coin Flipping in Dynamic Programming is Almost Useless

We consider probabilistic circuits working over the real numbers, and us...
research
03/24/2022

Grid Induced Minor Theorem for Graphs of Small Degree

A graph H is an induced minor of a graph G if H can be obtained from G b...
research
06/27/2018

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

Many combinatorial problems can be solved in time O^*(c^tw) on graphs of...
research
09/16/2020

Tropical Kirchhoff's Formula and Postoptimality in Matroid Optimization

Given an assignment of real weights to the ground elements of a matroid,...
research
11/07/2018

Connecting Knowledge Compilation Classes and Width Parameters

The field of knowledge compilation establishes the tractability of many ...
research
02/10/2022

A Robust Version of Hegedűs's Lemma, with Applications

Hegedűs's lemma is the following combinatorial statement regarding polyn...
research
11/01/2022

On the zeroes of hypergraph independence polynomials

We study the locations of complex zeroes of independence polynomials of ...

Please sign up or login with your details

Forgot password? Click here to reset