Abstract
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 \(\mathcal{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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)
Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335–350 (1976)
Bodlaender, H.L., Jansen, K.: On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 291–300. Springer, Heidelberg (1993)
Bogomolnaia, A., Moulin, H.: Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Rice University, Mimeo (2008)
Darmann, A., Klamler, C., Pferschy, U.: Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 58, 238–250 (2009)
Dutta, B., Kar, A.: Cost monotonicity, consistency and minimum cost spanning tree games. Games and Economic Behavior 48, 223–248 (2004)
Edmonds, J.: Matroid intersection. Annals of Discrete Mathematics 4, 39–49 (1979)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Jansen, K.: An approximation scheme for bin packing with conflicts. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol. 1432, pp. 35–46. Springer, Heidelberg (1998)
Jansen, K., Öhring, S.: Approximation algorithms for time constrained scheduling. Information and Computation 132(2), 85–108 (1997)
Kar, A.: Axiomatization of the shapley value on minimum cost spanning tree games. Games and Economic Behavior, 265–277 (2002)
Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. Optimization Online 2008-10-2128 (2008)
Schrijver, A.: Combinatorial Optimization, Polyhedra and efficiency, vol. B. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Darmann, A., Pferschy, U., Schauer, J. (2009). Determining a Minimum Spanning Tree with Disjunctive Constraints. In: Rossi, F., Tsoukias, A. (eds) Algorithmic Decision Theory. ADT 2009. Lecture Notes in Computer Science(), vol 5783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04428-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-04428-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04427-4
Online ISBN: 978-3-642-04428-1
eBook Packages: Computer ScienceComputer Science (R0)