{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:11:59Z","timestamp":1775862719967,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642044274","type":"print"},{"value":"9783642044281","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04428-1_36","type":"book-chapter","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T12:05:58Z","timestamp":1255089958000},"page":"414-423","source":"Crossref","is-referenced-by-count":17,"title":["Determining a Minimum Spanning Tree with Disjunctive Constraints"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Darmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C.G. Bird","year":"1976","unstructured":"Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks\u00a06, 335\u2013350 (1976)","journal-title":"Networks"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-57182-5_21","volume-title":"Mathematical Foundations of Computer Science 1993","author":"H.L. Bodlaender","year":"1993","unstructured":"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.\u00a0711, pp. 291\u2013300. Springer, Heidelberg (1993)"},{"key":"36_CR4","unstructured":"Bogomolnaia, A., Moulin, H.: Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Rice University, Mimeo (2008)"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.mathsocsci.2009.05.002","volume":"58","author":"A. Darmann","year":"2009","unstructured":"Darmann, A., Klamler, C., Pferschy, U.: Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences\u00a058, 238\u2013250 (2009)","journal-title":"Mathematical Social Sciences"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.geb.2003.09.008","volume":"48","author":"B. Dutta","year":"2004","unstructured":"Dutta, B., Kar, A.: Cost monotonicity, consistency and minimum cost spanning tree games. Games and Economic Behavior\u00a048, 223\u2013248 (2004)","journal-title":"Games and Economic Behavior"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"Edmonds, J.: Matroid intersection. Annals of Discrete Mathematics\u00a04, 39\u201349 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"36_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BFb0054353","volume-title":"Algorithm Theory - SWAT\u201998","author":"K. Jansen","year":"1998","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 35\u201346. Springer, Heidelberg (1998)"},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., \u00d6hring, S.: Approximation algorithms for time constrained scheduling. Information and Computation\u00a0132(2), 85\u2013108 (1997)","journal-title":"Information and Computation"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Kar, A.: Axiomatization of the shapley value on minimum cost spanning tree games. Games and Economic Behavior, 265\u2013277 (2002)","DOI":"10.1006\/game.2001.0883"},{"key":"36_CR12","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. Optimization Online 2008-10-2128 (2008)"},{"key":"36_CR13","volume-title":"Combinatorial Optimization, Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and efficiency, vol.\u00a0B. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04428-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:05:58Z","timestamp":1602324358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04428-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044274","9783642044281"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04428-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}