{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T01:18:48Z","timestamp":1771377528486,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,21]],"date-time":"2007-12-21T00:00:00Z","timestamp":1198195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00224-007-9072-z","type":"journal-article","created":{"date-parts":[[2007,12,20]],"date-time":"2007-12-20T11:58:39Z","timestamp":1198151919000},"page":"19-37","source":"Crossref","is-referenced-by-count":9,"title":["Approximately Fair Cost Allocation in Metric Traveling Salesman Games"],"prefix":"10.1007","volume":"43","author":[{"given":"M.","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Shankar Ram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,21]]},"reference":[{"key":"9072_CR1","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Technical Report TR03-022, ECCC (2003)"},{"key":"9072_CR2","doi-asserted-by":"crossref","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 6, 335\u2013350 (1976)","journal-title":"Networks"},{"key":"9072_CR3","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X. Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"9072_CR4","first-page":"89","volume-title":"Proceedings of Calgary International Conference on Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Johnson, L.: Matching: a well-solved class of integer linear programs. In: Proceedings of Calgary International Conference on Combinatorial Structures and their Applications, pp. 89\u201392. Gordon and Breach, New York (1970)"},{"key":"9072_CR5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s101070050008","volume":"87","author":"U. Faigle","year":"2000","unstructured":"Faigle, U., Kern, W.: On the core of ordered submodular cost games. Math. Program. 87, 483\u2013499 (2000)","journal-title":"Math. Program."},{"key":"9072_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01545526","volume":"20","author":"U. Faigle","year":"1998","unstructured":"Faigle, U., Fekete, S.P., Hochst\u00e4ttler, W., Kern, W.: On approximately fair cost allocation in Euclidean TSP games. OR Spektrum 20, 29\u201337 (1998)","journal-title":"OR Spektrum"},{"key":"9072_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A. Frieze","year":"1982","unstructured":"Frieze, A., Galbiati, G., Maffioli, F.: On the worst\u2013case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23\u201339 (1982)","journal-title":"Networks"},{"key":"9072_CR8","unstructured":"Goemans, M.X., Skutella, M.: Cooperative facility location games. In: Proc. 11th SODA, pp.\u00a076\u201385 (2000)"},{"key":"9072_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: Minimum cost spanning tree games. Math. Program. 21, 1\u201318 (1981)","journal-title":"Math. Program."},{"key":"9072_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s101070050093","volume":"86","author":"D. Granot","year":"1999","unstructured":"Granot, D., Hamers, H., Tijs, S.: On some balanced, totally balanced and submodular delivery games. Math. Program. 86, 355\u2013366 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"9072_CR11","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4), 602\u2013626 (2005)","journal-title":"J. ACM"},{"key":"9072_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/0377-2217(83)90197-2","volume":"12","author":"A. Kolen","year":"1983","unstructured":"Kolen, A.: Solving covering problems and the uncapacitated plant location algorithms. Eur. J. Oper. Res. 12, 266\u2013278 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"9072_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"9072_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189\u2013196 (1978)","journal-title":"Math. Oper. Res."},{"key":"9072_CR15","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.dam.2003.08.005","volume":"138","author":"Y. Okamoto","year":"2004","unstructured":"Okamoto, Y.: Traveling salesman games with the Monge property. Discrete Appl. Math. 138, 349\u2013369 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1\u201311 (1993)","journal-title":"Math. Oper. Res."},{"key":"9072_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585702","volume":"53","author":"J.A.M. Potters","year":"1992","unstructured":"Potters, J.A.M., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Math. Program. 53, 199\u2013211 (1992)","journal-title":"Math. Program."},{"key":"9072_CR18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L. Shapley","year":"1972","unstructured":"Shapley, L., Shubik, M.: The assignment game I: the core. Int. J. Game Theory 1, 111\u2013130 (1972)","journal-title":"Int. J. Game Theory"},{"key":"9072_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-6377(89)90030-8","volume":"8","author":"A. Tamir","year":"1988","unstructured":"Tamir, A.: On the core of a traveling salesman cost allocation game. Oper. Res. Lett. 8, 31\u201334 (1988)","journal-title":"Oper. Res. Lett."},{"key":"9072_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8, 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR21","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9072-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9072-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9072-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:35Z","timestamp":1558684295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9072-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9072"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9072-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,21]]}}}