{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T05:55:58Z","timestamp":1775109358101,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450297","type":"print"},{"value":"9783642450303","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_60","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"644-654","source":"Crossref","is-referenced-by-count":4,"title":["Euclidean Traveling Salesman Tours through Stochastic Neighborhoods"],"prefix":"10.1007","author":[{"given":"Pegah","family":"Kamousi","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E.M. Arkin","year":"1995","unstructured":"Arkin, E.M., Hassin, R.: Approximation Algorithms For The Geometric Covering Salesman Problem. Discrete Applied Mathematics\u00a055, 197\u2013218 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"60_CR2","unstructured":"Asmussen, S.: Applied Probability and Queues. Springer (2003)"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J.H., Hammersley, J.M.: The Shortest Path Through Many Points. Proc. Cambridge Philos. Soc.\u00a055, 299\u2013327 (1959)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"60_CR4","unstructured":"Bertsimas, D.: Probabilistic Combinatorial Optimization Problems. PhD thesis, Operation Research Center. MIT, Cambridge, MASS (1988)"},{"issue":"3","key":"60_CR5","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1002\/rob.20384","volume":"28","author":"D. Bhadauria","year":"2011","unstructured":"Bhadauria, D., Tekdas, O., Isler, V.: Robotic Data Mules for Collecting Data over Sparse Sensor Fields. J. Field Robot.\u00a028(3), 388\u2013404 (2011)","journal-title":"J. Field Robot."},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.-H.H., Elbassioni, K.: A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. In: SODA 2010, pp. 256\u2013267 (2010)","DOI":"10.1137\/1.9781611973075.22"},{"issue":"1","key":"60_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M. Berg de","year":"2005","unstructured":"de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with Neighborhoods of Varying Size. J. Algorithms\u00a057(1), 22\u201336 (2005)","journal-title":"J. Algorithms"},{"key":"60_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11496915_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Dhamdhere","year":"2005","unstructured":"Dhamdhere, K., Ravi, R., Singh, M.: On Two-Stage Stochastic Minimum Spanning Trees. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"issue":"1","key":"60_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A. Dumitrescu","year":"2003","unstructured":"Dumitrescu, A., Mitchel, J.S.B.: Approximation Algorithms for TSP with Neighborhoods in the Plane. Journal of Algorithms\u00a048(1), 135\u2013159 (2003)","journal-title":"Journal of Algorithms"},{"key":"60_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11940128_23","volume-title":"Algorithms and Computation","author":"K.M. Elbassioni","year":"2006","unstructured":"Elbassioni, K.M., Fishkin, A.V., Sitters, R.: On Approximating the TSP with Intersecting Neighborhoods. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 213\u2013222. Springer, Heidelberg (2006)"},{"issue":"2","key":"60_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0218195909002897","volume":"19","author":"K.M. Elbassioni","year":"2009","unstructured":"Elbassioni, K.M., Fishkin, A.V., Sitters, R.: Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geometry Appl.\u00a019(2), 173\u2013193 (2009)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"60_CR12","unstructured":"Feremans, C., Grigoriev, A.: Approximation Schemes for the Generalized Geometric Problems with Geographic Clustering, pp. 101\u2013102 (2005)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Flaxman, A.D., Frieze, A., Krivelevich, M.: On the Random 2-Stage Minimum Spanning Tree. In: SODA 2005, pp. 919\u2013926 (2005)","DOI":"10.1002\/rsa.20079"},{"key":"60_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-15369-3_14","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I. Gorodezky","year":"2010","unstructured":"Gorodezky, I., Kleinberg, R., Shmoys, D., Spencer, G.: Improved Lower Bounds for the Universal and a priori TSP. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol.\u00a06302, pp. 178\u2013191. Springer, Heidelberg (2010)"},{"key":"60_CR15","unstructured":"Gudmundsson, J., Levcopoulos, C.: Hardness Result for TSP with Neighborhoods. Technical report (2000)"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, P., Martin, A., Ravi, R., Sinha, A.: Boosted Sampling: Approximation Algorithms for Stochastic Optimization. In: Proc. 36th Annual ACM Symposium on Theory of Computing, pp. 417\u2013426 (2003)","DOI":"10.1145\/1007352.1007419"},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Leighton, T.: Improved Lower and Upper Bounds for Universal TSP in Planar Metrics. In: SODA 2006, pp. 649\u2013658 (2006)","DOI":"10.1145\/1109557.1109628"},{"key":"60_CR18","unstructured":"Immorlica, N., Karger, M., Minkoff, D., Mirrokni, V.S.: On the Costs and Benefits of Procrastination: Approximation Algorithms for Stochastic Combinatorial Optimization Problems. In: SODA 2004, pp. 691\u2013700 (2004)"},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"Jaillet, P.: A priori Solution of a Traveling Salesman Problem in which a Random Subset of the Customers are Visited. Math. Oper. Res.\u00a06(6) (1988)","DOI":"10.1287\/opre.36.6.929"},{"issue":"2-3","key":"60_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2008.08.010","volume":"408","author":"I. Katriel","year":"2008","unstructured":"Katriel, I., Kenyon-Mathieu, C., Upfal, E.: Commitment under Uncertainty: Two-Stage Stochastic Matching Problems. Theoretical Computer Science\u00a0408(2-3), 213\u2013223 (2008)","journal-title":"Theoretical Computer Science"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"Mata, C.S., Mitchell, J.S.B.: Approximation Algorithms for Geometric Tour and Network Design Problems. In: SoCG 1995, pp. 360\u2013369. ACM (1995)","DOI":"10.1145\/220279.220318"},{"key":"60_CR22","unstructured":"Mitchell, J.S.B.: A PTAS for TSP with Neighborhoods among Fat Regions in the Plane. In: SODA 2007, pp. 11\u201318 (2007)"},{"key":"60_CR23","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: A Constant-Factor Approximation Algorithm for TSP with Pairwise-Disjoint Connected Neighborhoods in the Plane. In: SoCG 2010, pp. 183\u2013191 (2010)","DOI":"10.1145\/1810959.1810992"},{"key":"60_CR24","doi-asserted-by":"crossref","unstructured":"Muetze, T., Stuedi, P., Kuhn, F., Alonso, G.: Understanding Radio Irregularity in Wireless Networks. In: SECON 2008, pp. 82\u201390 (2008)","DOI":"10.1109\/SAHCN.2008.20"},{"issue":"4","key":"60_CR25","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"L.K. Platzman","year":"1989","unstructured":"Platzman, L.K., Bartholdi III, J.: Spacefilling Curves and the Planar Travelling Salesman Problem. J. ACM\u00a036(4), 719\u2013737 (1989)","journal-title":"J. ACM"},{"key":"60_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-68891-4_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"D.B. Shmoys","year":"2008","unstructured":"Shmoys, D.B., Talwar, K.: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 331\u2013343. Springer, Heidelberg (2008)"},{"issue":"1","key":"60_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1122480.1122493","volume":"37","author":"C. Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation Algorithms for 2-stage Stochastic Optimization Problems. SIGACT News\u00a037(1), 33\u201346 (2006)","journal-title":"SIGACT News"},{"issue":"1","key":"60_CR28","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MWC.2009.4804365","volume":"16","author":"O. Tekdas","year":"2009","unstructured":"Tekdas, O., Isler, V., Lim, J.H., Terzis, A.: Using Mobile Robots to Harvest Data from Sensor Fields. Wireless Commun.\u00a016(1), 22\u201328 (2009)","journal-title":"Wireless Commun."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:31:22Z","timestamp":1558765882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}