The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract)

Christos H. Papadimitriou, Mihalis Yannakakis

Abstract: We examine the complexity of finding in a given finite metric the shortest spanning tree which satisfies a property P. Most problems discussed in the mathematical programming literature—including the minimum spanning tree problem, the matching problem matroid intersection, the travelling salesman problem, and many others—can be thus formulated. We study in particular isomonphism properties—those that are satisfied by at most one tree with a given number of nodes. We show that the complexity of these problems is captured by the rate of growth of a rather unexpected—and easy to calculate—parameter.