On Finding Optimal Polytrees

by   Serge Gaspers, et al.

Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to polytrees of bounded in-degree. Polynomial-time algorithms are known only for rare special cases, perhaps most notably for branchings, that is, polytrees in which the in-degree of every node is at most one. Here, we study the complexity of finding an optimal polytree that can be turned into a branching by deleting some number of arcs or nodes, treated as a parameter. We show that the problem can be solved via a matroid intersection formulation in polynomial time if the number of deleted arcs is bounded by a constant. The order of the polynomial time bound depends on this constant, hence the algorithm does not establish fixed-parameter tractability when parameterized by the number of deleted arcs. We show that a restricted version of the problem allows fixed-parameter tractability and hence scales well with the parameter. We contrast this positive result by showing that if we parameterize by the number of deleted nodes, a somewhat more powerful parameter, the problem is not fixed-parameter tractable, subject to a complexity-theoretic assumption.


page 1

page 2

page 3

page 4


The Parameterized Complexity of Finding Minimum Bounded Chains

Finding the smallest d-chain with a specific (d-1)-boundary in a simplic...

The 2-MAXSAT Problem Can Be Solved in Polynomial Time

By the MAXSAT problem, we are given a set V of m variables and a collect...

A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes

We consider the routing flow shop problem with two machines on an asymme...

Algorithms and Complexity for Variants of Covariates Fine Balance

We study here several variants of the covariates fine balance problem wh...

Parametrized Complexity of Manipulating Sequential Allocation

The sequential allocation protocol is a simple and popular mechanism to ...

Efficient Optimal Planning in non-FIFO Time-Dependent Flow Fields

We propose an algorithm for solving the time-dependent shortest path pro...

Most IPs with bounded determinants can be solved in polynomial time

In 1983 Lenstra showed that an integer program (IP) is fixed parameter t...

Please sign up or login with your details

Forgot password? Click here to reset