{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:38Z","timestamp":1725544298374},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_7","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"82-95","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Fair Cost Allocation in Metric Traveling Salesman Games"],"prefix":"10.1007","author":[{"given":"M.","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Shankar","family":"Ram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_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":"7_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":"7_CR3","doi-asserted-by":"publisher","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.\u00a024, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"7_CR4","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, Gordon and Breach, pp. 89\u201392 (1970)"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00453-002-1001-6","volume":"35","author":"L. Engebretsen","year":"2003","unstructured":"Engebretsen, L.: An explicit lower bound for TSP with distances one and two. Algorithmica\u00a035(4), 301\u2013319 (2003)","journal-title":"Algorithmica"},{"key":"7_CR6","doi-asserted-by":"publisher","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\u00a020, 29\u201337 (1998)","journal-title":"OR Spektrum"},{"key":"7_CR7","doi-asserted-by":"publisher","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.\u00a087, 483\u2013499 (2000)","journal-title":"Math. Program."},{"key":"7_CR8","doi-asserted-by":"publisher","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\u00a012, 23\u201339 (1982)","journal-title":"Networks"},{"key":"7_CR9","unstructured":"Goemans, M.X., Skutella, M.: Cooperative facility location games. In: Proc. 11th SODA, pp. 76\u201385 (2000)"},{"key":"7_CR10","doi-asserted-by":"publisher","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.\u00a086, 355\u2013366 (1999)","journal-title":"Math. Program."},{"key":"7_CR11","doi-asserted-by":"publisher","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.\u00a021, 1\u201318 (1981)","journal-title":"Math. Program."},{"key":"7_CR12","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: A 2\/3 approximation for maximum asymmetric TSP by decomposing directed regular multi graphs. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003)"},{"key":"7_CR13","doi-asserted-by":"publisher","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.\u00a012, 266\u2013278 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR14","doi-asserted-by":"publisher","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.\u00a02, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"7_CR15","doi-asserted-by":"publisher","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. Disc. Appl. Math.\u00a0138, 349\u2013369 (2004)","journal-title":"Disc. Appl. Math."},{"key":"7_CR16","doi-asserted-by":"publisher","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.\u00a018, 1\u201311 (1993)","journal-title":"Math. Oper. Res."},{"key":"7_CR17","doi-asserted-by":"publisher","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.\u00a053, 199\u2013211 (1992)","journal-title":"Math. Program."},{"key":"7_CR18","doi-asserted-by":"publisher","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\u00a01, 111\u2013130 (1972)","journal-title":"Int. J. Game Theory"},{"key":"7_CR19","doi-asserted-by":"publisher","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.\u00a08, 31\u201334 (1988)","journal-title":"Oper. Res. Lett."},{"key":"7_CR20","doi-asserted-by":"publisher","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. Disc. Appl. Math.\u00a08, 85\u201389 (1984)","journal-title":"Disc. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:27Z","timestamp":1619507667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11671411_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}