{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:42:43Z","timestamp":1773092563431,"version":"3.50.1"},"reference-count":7,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10451,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the supplier is given by a minimal Steiner tree. An example is given in which for every allocation of the total cost of the tree to the consumers, a coalition of consumers exists, which is charged more than the cost required for connecting its members to the central supplier.<\/jats:p>","DOI":"10.1002\/net.3230080104","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:20:04Z","timestamp":1178871604000},"page":"1-6","source":"Crossref","is-referenced-by-count":65,"title":["Cost allocation for steiner trees"],"prefix":"10.1002","volume":"8","author":[{"given":"N.","family":"Megiddo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graph Theory: An Algorithmic Approach","author":"Christofides N.","year":"1975"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030402"},{"key":"e_1_2_1_4_2","volume-title":"Game Theory Application to Cost Allocation for a Spanning Tree","author":"Claus A.","year":"1976"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_1_6_2","volume-title":"On the Core of a Minimum Spanning Tree Game","author":"Granot D.","year":"1976"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1961-016-2"},{"key":"e_1_2_1_8_2","volume-title":"Game Theory","author":"Owen G.","year":"1968"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:05:14Z","timestamp":1699779914000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,3]]}},"alternative-id":["10.1002\/net.3230080104"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080104","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,3]]}}}