{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:07:34Z","timestamp":1762322854225},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00388-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"555-563","source":"Crossref","is-referenced-by-count":5,"title":["Total balancedness condition for Steiner tree games"],"prefix":"10.1016","volume":"127","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maocheng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00388-8_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","article-title":"On cost allocation for a spanning tree","volume":"6","author":"Bird","year":"1976","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB2","first-page":"119","article-title":"Some applications of linear programming methods to the theory of cooperative games","volume":"10","author":"Bondareva","year":"1963","journal-title":"Problemy Kibernetiki"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB3","unstructured":"I.J. Curiel, Cooperative game theory and applications, Ph.D. dissertation, University of Nijmegen, Netherlands, 1988."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB4","first-page":"77","article-title":"Combinatorial optimization and coalition games","volume":"Vol. 2","author":"Deng","year":"1998"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","article-title":"Algorithmic aspects of the core of combinatorial optimization games","volume":"24","author":"Deng","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB6","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s101070050005","article-title":"Totally balanced combinatorial optimization games","volume":"87","author":"Deng","year":"2000","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","article-title":"On the complexity of cooperative solution concepts","volume":"19","author":"Deng","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263277","article-title":"On the complexity of testing membership in the core of min-cost spanning tree games","volume":"26","author":"Faigle","year":"1997","journal-title":"Int. J. Game Theory"},{"year":"1979","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0166-218X(02)00388-8_BIB9"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB10","unstructured":"M.X. Goemans, M. Skutella, Cooperative facility location games, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 76\u201385."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","article-title":"Minimum cost spanning tree games","volume":"21","author":"Granot","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s001820050085","article-title":"Spanning network games","volume":"27","author":"Granot","year":"1998","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB13","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/moor.7.3.476","article-title":"Totally balanced games and games of flow","volume":"7","author":"Kalai","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230080104","article-title":"Cost allocation for Steiner trees","volume":"8","author":"Megiddo","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB15","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","article-title":"On the core of linear production games","volume":"9","author":"Owen","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00388-8_BIB16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800140404","article-title":"On balanced sets and cores","volume":"14","author":"Shapley","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(02)00388-8_BIB17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0022-0531(69)90008-8","article-title":"On market games","volume":"1","author":"Shapley","year":"1969","journal-title":"J. Econ. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003888?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003888?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:20:47Z","timestamp":1553905247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003888"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00388-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}