{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:48Z","timestamp":1725544728650},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_31","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"311-322","source":"Crossref","is-referenced-by-count":11,"title":["Oblivious Medians Via Online Bidding"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[]},{"given":"Neal E.","family":"Young","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Rajagopalan, R., Shmoys, D.B.: Lagrangian relaxation for the kmedian problem: new insights and continuity properties. In: Proc. 11th European Symp. on Algorithms (ESA), pp. 31\u201342 (2003)","DOI":"10.1007\/978-3-540-39658-1_6"},{"key":"31_CR2","first-page":"21","volume-title":"Proc. 33rd Symp. Theory of Computing (STOC)","author":"V. Arya","year":"2001","unstructured":"Arya, V., Garg, N., Khandekar, R., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: Proc. 33rd Symp. Theory of Computing (STOC), pp. 21\u201329. ACM, New York (2001)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Automata, Languages and Programming, pp. 646\u2013657 (1996)","DOI":"10.1007\/3-540-61440-0_166"},{"key":"31_CR4","first-page":"626","volume-title":"Proc. 29th Symp. Theory of Computing (STOC)","author":"M. Charikar","year":"1997","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proc. 29th Symp. Theory of Computing (STOC), pp. 626\u2013635. ACM, New York (1997)"},{"key":"31_CR5","first-page":"378","volume-title":"Proc. 40th Symp. Foundations of Computer Science (FOCS)","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proc. 40th Symp. Foundations of Computer Science (FOCS), pp. 378\u2013388. IEEE, Los Alamitos (1999)"},{"key":"31_CR6","first-page":"1","volume-title":"Proc. 31st Symp. Theory of Computing (STOC)","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proc. 31st Symp. Theory of Computing (STOC), pp. 1\u201310. ACM, New York (1999)"},{"key":"31_CR7","first-page":"363","volume-title":"Proc. 36th Symp. Theory of Computing (STOC)","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with \u03b5-resource augmentation. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 363\u2013372. ACM, New York (2004)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2005.09.009","volume":"97","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., Kenyon, C., Young, N.E.: The reverse greedy algorithm for the k-median problem. Information Processing Letters\u00a097, 68\u201372 (2006)","journal-title":"Information Processing Letters"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.jcss.2004.10.006","volume":"70","author":"S. Dasgupta","year":"2005","unstructured":"Dasgupta, S., Long, P.M.: Performance guarantees for hierarchical clustering. Journal of Computer and System Sciences\u00a070(4), 555\u2013569 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008023416823","volume":"30","author":"R. Fagin","year":"1998","unstructured":"Fagin, R., Stockmeyer, L.: Relaxing the triangle inequality in pattern matching. IJCV: International Journal of Computer Vision\u00a030, 219\u2013231 (1998)","journal-title":"IJCV: International Journal of Computer Vision"},{"key":"31_CR11","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: Proc. 7th Symp. on Discrete Algorithms (SODA), pp. 152\u2013158. ACM\/SIAM (1996)"},{"key":"31_CR12","first-page":"731","volume-title":"Proc. 34th Symp. Theory of Computing (STOC)","author":"K. Jain","year":"2002","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 731\u2013740. ACM, New York (2002)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of ACM\u00a048, 274\u2013296 (2001)","journal-title":"Journal of ACM"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047, 214\u2013221 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M. Kao","year":"1996","unstructured":"Kao, M., Reif, J.H., Tate, S.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation\u00a0131(1), 63\u201380 (1996); Preliminary version appeared in the Proceedings of the Symp. on Discrete Algorithms, Austin, TX (January 1993)","journal-title":"Information and Computation"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"M.R. Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. Journal of Algorithms\u00a037, 146\u2013188 (2000)","journal-title":"Journal of Algorithms"},{"key":"31_CR17","first-page":"444","volume-title":"Proc. 40th Symp. Foundations of Computer Science (FOCS)","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E.: Weak adversaries for the k-server problem. In: Proc. 40th Symp. Foundations of Computer Science (FOCS), pp. 444\u2013449. IEEE, Los Alamitos (1999)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Lin, G., Nagarajan, C., Rajamaran, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. In: Proc. 17th Symp. on Discrete Algorithms (SODA). ACM\/SIAM (2006)","DOI":"10.1145\/1109557.1109684"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J.-H. Lin","year":"1992","unstructured":"Lin, J.-H., Vitter, J.S.: Approximation algorithms for geometric median problems. Information Processing Letters\u00a044, 245\u2013249 (1992)","journal-title":"Information Processing Letters"},{"key":"31_CR20","first-page":"771","volume-title":"Proc. 24th Symp. Theory of Computing (STOC)","author":"J.-H. Lin","year":"1992","unstructured":"Lin, J.-H., Vitter, J.S.: \u03b5-approximations with minimum packing constraint violation (extended abstract). In: Proc. 24th Symp. Theory of Computing (STOC), pp. 771\u2013782. ACM, New York (1992)"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"R. Mettu","year":"2003","unstructured":"Mettu, R., Plaxton, C.G.: The online median problem. SIAM Journal on Computing\u00a032, 816\u2013832 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR22","first-page":"339","volume-title":"Proc. 41st Symp. Foundations of Computer Science (FOCS)","author":"R.R. Mettu","year":"2000","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. In: Proc. 41st Symp. Foundations of Computer Science (FOCS), pp. 339\u2013348. IEEE, Los Alamitos (2000)"},{"issue":"1","key":"31_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Nonclairvoyant scheduling. Theoretical Computer Science\u00a0130(1), 17\u201347 (1994)","journal-title":"Theoretical Computer Science"},{"key":"31_CR24","unstructured":"Young, N.E.: K-medians, facility location, and the Chernoff-Wald bound. In: Proc. 11th Symp. on Discrete Algorithms (SODA), pp. 86\u201395. ACM\/SIAM (January 2000)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:33Z","timestamp":1555445913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11682462_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}