A Unifying Model for Locally Constrained Spanning Tree Problems

Given a graph G and a digraph D whose vertices are the edges of G, we investigate the problem of finding a spanning tree of G that satisfies the constraints imposed by D. The restrictions to add an edge in the tree depend on its neighborhood in D. Here, we generalize previously investigated problems by also considering as input functions ℓ and u on E(G) that give a lower and an upper bound, respectively, on the number of constraints that must be satisfied by each edge. The produced feasibility problem is denoted by G-DCST, while the optimization problem is denoted by G-DCMST. We show that G-DCST is NP-complete even under strong assumptions on the structures of G and D, as well as on functions ℓ and u. On the positive side, we prove two polynomial results, one for G-DCST and another for G-DCMST, and also give a simple exponential-time algorithm along with a proof that it is asymptotically optimal under the . Finally, we prove that other previously studied constrained spanning tree (CST) problems can be modeled within our framework, namely, the Conflict CST, the Forcing CS, the At Least One/All Dependency CST, the Maximum Degree CST, the Minimum Degree CST, and the Fixed-Leaves Minimum Degree CST.


page 1

page 2

page 3

page 4


1-skeletons of the spanning tree problems with additional constraints

We consider the polyhedral properties of two spanning tree problems with...

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint

We investigate the complexity of finding a transformation from a given s...

A Solution of Degree Constrained Spanning Tree Using Hybrid GA

In real life, it is always an urge to reach our goal in minimum effort i...

Spanning Trees With Edge Conflicts and Wireless Connectivity

We introduce the problem of finding a spanning tree along with a partiti...

Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects

We consider cost constrained versions of the minimum spanning tree probl...

NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems

Spanning tree problems with special constraints are widely applied in re...

Towards an intelligent VNS heuristic for the k-labelled spanning forest problem

In a currently ongoing project, we investigate a new possibility for sol...

Please sign up or login with your details

Forgot password? Click here to reset