{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:52Z","timestamp":1725558952921},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_11","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"114-126","source":"Crossref","is-referenced-by-count":1,"title":["Online Network Design with Outliers"],"prefix":"10.1007","author":[{"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exch.\u00a07(2), 1\u201311 (2008)","journal-title":"SIGecom Exch."},{"key":"11_CR3","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, Philadelphia, PA, USA. pp. 434\u2013443, Society for Industrial and Applied Mathematics (2007)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: STOC 1998: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 161\u2013168 (1998)","DOI":"10.1145\/276698.276725"},{"key":"11_CR5","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"616","DOI":"10.2307\/3214770","volume":"30","author":"F.T. Bruce","year":"1993","unstructured":"Bruce, F.T., Ferguson, T.S.: Minimizing the expected rank with full information. Journal of Applied Probability\u00a030(3), 616\u2013626 (1993)","journal-title":"Journal of Applied Probability"},{"key":"11_CR7","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA 2001: Proceedings of the 12th annual ACM-SIAM symposium on Discrete algorithms, pp. 642\u2013651 (2001)"},{"key":"11_CR8","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a markov process. Sov. Math. Dokl.\u00a04 (1963)"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences\u00a069(4), 485\u2013497 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Online Algorithms","year":"1998","unstructured":"Fiat, A. (ed.): Dagstuhl Seminar 1996. LNCS, vol.\u00a01442. Springer, Berlin (1998)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2307\/1402748","volume":"51","author":"P. Freeman","year":"1983","unstructured":"Freeman, P.: The secretary problem and its extensions: a review. Internat. Statist. Rev.\u00a051(2), 189\u2013206 (1983)","journal-title":"Internat. Statist. Rev."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-mst problem in graphs. In: STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"key":"11_CR13","unstructured":"Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: SODA 2008, pp. 942\u2013951 (2008)"},{"issue":"313","key":"11_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/2283044","volume":"61","author":"J.P. Gilbert","year":"1966","unstructured":"Gilbert, J.P., Mosteller, F.: Recognizing the maximum of a sequence. Journal of the American Statistical Association\u00a061(313), 35\u201373 (1966)","journal-title":"Journal of the American Statistical Association"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004: Proceedings of the 5th ACM conference on Electronic commerce, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR17","unstructured":"Irani, S., Karlin, A.R.: On online computation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP Hard Problems. PWS publishing Co. (1996)"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A.R. Karlin","year":"2000","unstructured":"Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput.\u00a030(3), 906\u2013922 (2000)","journal-title":"SIAM J. Comput."},{"key":"11_CR19","unstructured":"Karlin, S.: Stochastic models and optimal policy for selling an asset. In: Studies in applied probability and management science, pp. 148\u2013158 (1962)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-4149(87)90029-9","volume":"24","author":"D. Kennedy","year":"1987","unstructured":"Kennedy, D.: Prophet-type inequalities for multichoice optimal stopping. Stoch. Proc. Appl.\u00a024(1), 77\u201388 (1987)","journal-title":"Stoch. Proc. Appl."},{"key":"11_CR21","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp. 630\u2013631 (2005)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"A.J. Kleywegt","year":"1998","unstructured":"Kleywegt, A.J., Papastavrou, J.D.: The dynamic and stochastic knapsack problem. Oper. Res.\u00a046(1), 17\u201335 (1998)","journal-title":"Oper. Res."},{"key":"11_CR23","unstructured":"Korula, N., Pal, M.: Algorithms for secretary problems on graphs and hypergraphs. CoRR, abs\/0807.1139 (2008)"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E. Koutsoupias","year":"2000","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM J. Comput.\u00a030(1), 300\u2013317 (2000)","journal-title":"SIAM J. Comput."},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Applied Statistics\u00a010, 39\u201351 (1961)","journal-title":"Applied Statistics"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: FOCS 2001, pp. 426\u2013431 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Raghavan, P.: A statistical adversary for on-line algorithms. In: Online Algorithms. DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol.\u00a053, pp. 79\u201383 (1991)","DOI":"10.1090\/dimacs\/007\/05"},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput.\u00a06(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR29","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Comm. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Comm. ACM"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.2000.1099","volume":"37","author":"N.E. Young","year":"2000","unstructured":"Young, N.E.: On-line paging against adversarially biased random inputs. J. Algorithms\u00a037(1), 218\u2013235 (2000)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:41:38Z","timestamp":1558280498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}