{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:32Z","timestamp":1725490052588},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_54","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"559-567","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the Black and White Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhuang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Kononov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S. Anily","year":"1992","unstructured":"Anily, S., Hassin, R.: The swapping problem. Networks\u00a022, 419\u2013433 (1992)","journal-title":"Networks"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0305-0548(01)00082-X","volume":"30","author":"M. Bourgeois","year":"2003","unstructured":"Bourgeois, M., Laporte, G., Samet, F.: Heuristics for the black and white traveling salesman problem. Computers and Operations Research\u00a030, 75\u201385 (2003)","journal-title":"Computers and Operations Research"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"P. Chalasani","year":"1999","unstructured":"Chalasani, P., Motwani, R.: Approximating capacitated routing and delivery problems. SIAM Journal on Computing\u00a028, 2133\u20132149 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"54_CR4","unstructured":"Christofides, N.: The traveling salesman problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315\u2013318 (1979)"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM Journal on Computing\u00a011, 540\u2013546 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.25.1.20","volume":"25","author":"S. Cosares","year":"1995","unstructured":"Cosares, S., Deutsch, D.N., Saniee, I., Wasem, O.J.: SONET Toolkit: A decision support system for designing robust and cost effective fibre-optic networks. Interfaces\u00a025, 20\u201340 (1995)","journal-title":"Interfaces"},{"key":"54_CR7","unstructured":"Dinitz, D.: The solution of two assignment problems. In: Fridman, A.A. (ed.) Russian; Studies in Discrete Optimization, Nauka, Moscow, pp. 333\u2013348 (1976)"},{"key":"54_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45471-3_20","volume-title":"Algorithm Theory - SWAT 2002","author":"H.N. Gabow","year":"2002","unstructured":"Gabow, H.N., Pettie, S.: The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 190\u2013199. Springer, Heidelberg (2002)"},{"issue":"2","key":"54_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.1050.0218","volume":"54","author":"G. Ghiani","year":"2006","unstructured":"Ghiani, G., Laporte, G., Semet, F.: The black and white traveling salesman problem. Operations Research\u00a054, 366\u2013378 (2006)","journal-title":"Operations Research"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendungen. Math. Annalen\u00a077, 453\u2013465 (1916)","journal-title":"Math. Annalen"},{"key":"54_CR12","volume-title":"Combinatorial Optimization: Networks and Matroids. Holt","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt. Rinehart and Winston, New York (1976)"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1111\/j.1475-3995.2000.tb00209.x","volume":"7","author":"V. Mak","year":"2000","unstructured":"Mak, V., Boland, N.: Heuristic approaches to the asymmetric traveling salesman problem with replenishment arcs. International Transactions in Operations Research\u00a07, 431\u2013437 (2000)","journal-title":"International Transactions in Operations Research"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1287\/trsc.32.1.43","volume":"32","author":"K.T. Talluri","year":"1998","unstructured":"Talluri, K.T.: The four-day aircraft maintenance routing problem. Transportation Science\u00a032, 43\u201353 (1998)","journal-title":"Transportation Science"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/24.93762","volume":"40","author":"O.J. Wasem","year":"1991","unstructured":"Wasem, O.J.: An algorithm for designing rings in survivable fibre networks. IEEE Transactions on Reliability\u00a040, 428\u2013432 (1991)","journal-title":"IEEE Transactions on Reliability"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:18:04Z","timestamp":1619518684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}