For the classical minimum spanning tree problem we introduce disjunctive constraints for pairs of edges which can not be both included in the spanning tree at the same time. These constraints are represented by a conflict graph whose vertices correspond to the edges of the original graph. Edges in the conflict graph connect conflicting edges of the original graph. It is shown that the problem becomes strongly NP-hard even if the connected components of the conflict graph consist only of paths of length two. On the other hand, for conflict graphs consisting of disjoint edges (i.e. paths of length one) the problem remains polynomially solvable. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Darmann, A., Pferschy, U., & Schauer, J. (2009). Determining a minimum spanning tree with disjunctive constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5783 LNAI, pp. 414–423). https://doi.org/10.1007/978-3-642-04428-1_36
Mendeley helps you to discover research relevant for your work.