{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:01:06Z","timestamp":1775055666017,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319266251","type":"print"},{"value":"9783319266268","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_9","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"110-125","source":"Crossref","is-referenced-by-count":10,"title":["Approximation Algorithms for Generalized MST and TSP in Grid Clusters"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Ante","family":"\u0106usti\u0107","sequence":"additional","affiliation":[]},{"given":"Akbar","family":"Rafiey","sequence":"additional","affiliation":[]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[]},{"given":"Vladyslav","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9_CR2","unstructured":"Bovet, J.: The selective traveling salesman problem. Papers Presented at the EURO VI Conference, Vienna (1983)"},{"key":"9_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. In: Traub, J.F. (ed.) Symposium on New Directions and Recent Results in Algorithms and Complexity, p. 441. Academic Press, Orlando, Florida (1976)"},{"key":"9_CR4","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. In: Symposium on Discrete Algorithms, pp. 38\u201346 (2001)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1007\/11523468_90","volume-title":"Automata, Languages and Programming","author":"KM Elbassioni","year":"2005","unstructured":"Elbassioni, K.M., Fishkin, A.V., Mustafa, N.H., Sitters, R.A.: Approximation algorithms for Euclidean group TSP. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1115\u20131126. Springer, Heidelberg (2005)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-006-0012-6","volume":"4","author":"C Feremans","year":"2006","unstructured":"Feremans, C., Grigoriev, A., Sitters, R.: The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4, 319\u2013329 (2006)","journal-title":"4OR"},{"key":"9_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman, New York (1979)"},{"key":"9_CR8","unstructured":"Gudmundsson, J., Levcopoulos, C.: Hardness result for TSP with neighborhoods. Technical report LU-CS-TR:2000\u2013216, Department of Computer Science, Lund Unversity, Sweden (2000)"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/ijoc.1040.0077","volume":"17","author":"BL Golden","year":"2005","unstructured":"Golden, B.L., Raghavan, S., Stanojevic, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS J. Comput. 17(3), 290\u2013304 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Jiang, H., Chen, Y.: An efficient algorithm for generalized minimum spanning tree problem. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 217\u2013224 (2010)","DOI":"10.1145\/1830483.1830525"},{"key":"9_CR11","first-page":"736","volume":"B\u20132","author":"AL Henry-Labordere","year":"1969","unstructured":"Henry-Labordere, A.L.: The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. RIBO B\u20132, 736\u2013743 (1969)","journal-title":"RIBO"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte, G., Asef-Vaziri, A., Srikandarajah, C.: Some applications of the generalized traveling salesman problem. J. Oper. Res. Soc. 47, 1461\u20131467 (1996)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y-S Myung","year":"1995","unstructured":"Myung, Y.-S., Lee, C.-H., Tcha, D.-W.: On the generalized minimum spanning tree problem. Networks 26(4), 231\u2013241 (1995)","journal-title":"Networks"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 360\u2013369. ACM (1995)","DOI":"10.1145\/220279.220318"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.ejor.2007.08.021","volume":"191","author":"T Oncan","year":"2008","unstructured":"Oncan, T., Corseau, J.F., Laporte, G.: A tabu search heuristic for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 191, 306\u2013319 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: The generalized minimum spanning tree problem. Ph.D. Thesis, University of Twente (2002)","DOI":"10.1016\/S0377-2217(02)00213-8"},{"key":"9_CR18","unstructured":"Pop, P.C., Still, G., Kern, W.: An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. In: Proceedings of the First ACiD Workshop. Texts Algorithms vol. 4, pp. 115\u2013121 (2005)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-39658-1_41","volume-title":"Algorithms - ESA 2003","author":"S Safra","year":"2003","unstructured":"Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 446\u2013458. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:01:07Z","timestamp":1559322067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}