{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:16:15Z","timestamp":1743120975524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_50","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"606-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Center of Uncertain Points on Tree Networks"],"prefix":"10.1007","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jingru","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Cheng, S.W., Tao, Y., Yi, K.: Indexing uncertain data. In: Proc. of the 28th Symposium on Principles of Database Systems (PODS), pp. 137\u2013146 (2009)","DOI":"10.1145\/1559795.1559816"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Efrat, A., Sankararaman, S., Zhang, W.: Nearest-neighbor searching under uncertainty. In: Proc. of the 31st Symposium on Principles of Database Systems (PODS), pp. 225\u2013236 (2012)","DOI":"10.1145\/2213556.2213588"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-662-44777-2_4","volume-title":"Algorithms - ESA 2014","author":"PK Agarwal","year":"2014","unstructured":"Agarwal, P.K., Har-Peled, S., Suri, S., Y\u0131ld\u0131z, H., Zhang, W.: Convex hulls under uncertainty. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 37\u201348. Springer, Heidelberg (2014)"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.disopt.2004.12.001","volume":"2","author":"I Averbakh","year":"2005","unstructured":"Averbakh, I., Bereg, S.: Facility location problems with uncertainty on the plane. Discrete Optimization 2, 3\u201334 (2005)","journal-title":"Discrete Optimization"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic 2-centers in the black-box model. In: Proc. of the 29th Annual Symposium on Computational Geometry (SoCG), pp. 145\u2013154 (2013)","DOI":"10.1145\/2462356.2462393"},{"issue":"1","key":"50_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34(1), 200\u2013208 (1987)","journal-title":"Journal of the ACM"},{"issue":"3","key":"50_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.orl.2005.04.011","volume":"34","author":"A Foul","year":"2006","unstructured":"Foul, A.: A $$1$$-center problem on the plane with uniformly distributed demand points. Operations Research Letters 34(3), 264\u2013268 (2006)","journal-title":"Operations Research Letters"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0028271","volume-title":"Algorithms and Data Structures","author":"GN Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 299\u2013319. Springer, Heidelberg (1991)"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-22300-6_45","volume-title":"Algorithms and Data Structures","author":"A J\u00f8rgensen","year":"2011","unstructured":"J\u00f8rgensen, A., L\u00f6ffler, M., Phillips, J.M.: Geometric computations on indecisive points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 536\u2013547. Springer, Heidelberg (2011)"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-642-22300-6_46","volume-title":"Algorithms and Data Structures","author":"P Kamousi","year":"2011","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Closest pair and the post office problem for stochastic points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 548\u2013559. Springer, Heidelberg (2011)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Kamousi, P., Chan, T., Suri, S.: Stochastic minimum spanning trees in euclidean spaces. In: Proc. of the 27th Annual Symposium on Computational Geometry (SoCG), pp. 65\u201374 (2011)","DOI":"10.1145\/1998196.1998206"},{"issue":"3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. II: The $$p$$-medians. SIAM Journal on Applied Mathematics 37(3), 539\u2013560 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Computational Geometry: Theory and Applications 43(4), 419\u2013433 (2010)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"50_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$R^3$$ and related problems. SIAM Journal on Computing 12(4), 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM Journal on Comuting 13, 182\u2013196 (1984)","journal-title":"SIAM Journal on Comuting"},{"issue":"4","key":"50_CR16","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: New results on the complexity of $$p$$-centre problems. SIAM Journal on Computing 12(4), 751\u2013758 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0196-6774(86)90027-1","volume":"7","author":"N Megiddo","year":"1986","unstructured":"Megiddo, N., Zemel, E.: An $$O(n \\log n)$$ randomizing algorithm for the weighted Euclidean 1-center problem. Journal of Algorithms 7, 358\u2013368 (1986)","journal-title":"Journal of Algorithms"},{"key":"50_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-319-13075-0_27","volume-title":"Algorithms and Computation","author":"S Suri","year":"2014","unstructured":"Suri, S., Verbeek, K.: On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 338\u2013350. Springer, Heidelberg (2014)"},{"key":"50_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/978-3-642-40450-4_67","volume-title":"Algorithms \u2013 ESA 2013","author":"S Suri","year":"2013","unstructured":"Suri, S., Verbeek, K., Y\u0131ld\u0131z, H.: On the Most Likely Convex Hull of Uncertain Points. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 791\u2013802. Springer, Heidelberg (2013)"},{"key":"50_CR20","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2014.06.026","volume":"239","author":"H Wang","year":"2014","unstructured":"Wang, H.: Minmax regret 1-facility location on uncertain path networks. European Journal of Operational Research 239, 636\u2013643 (2014)","journal-title":"European Journal of Operational Research"},{"key":"50_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/978-3-319-08783-2_10","volume-title":"Computing and Combinatorics","author":"H Wang","year":"2014","unstructured":"Wang, H., Zhang, J.: One-dimensional k-center on uncertain data. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 104\u2013115. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:36:19Z","timestamp":1676468179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}