{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:54Z","timestamp":1725552354647},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_17","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"190-201","source":"Crossref","is-referenced-by-count":2,"title":["Randomized Rounding for Routing and Covering Problems: Experiments and Improvements"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[]},{"given":"Marvin","family":"K\u00fcnnemann","sequence":"additional","affiliation":[]},{"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A.A. Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim.\u00a08, 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM\u00a045, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science\u00a023, 789\u2013810 (1977)","journal-title":"Management Science"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/11672142_47","volume-title":"STACS 2006","author":"B. Doerr","year":"2006","unstructured":"Doerr, B.: Generating randomized roundings with cardinality constraints and derandomizations. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 571\u2013583. Springer, Heidelberg (2006)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Wahlstr\u00f6m, M.: Randomized rounding in the presence of a cardinality constraint. In: ALENEX 2009, pp. 162\u2013174 (2009)","DOI":"10.1137\/1.9781611972894.16"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: FOCS 2002, pp. 323\u2013332 (2002)","DOI":"10.1109\/SFCS.2002.1181955"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM\u00a053, 324\u2013360 (2006)","journal-title":"J. ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2004.07.005","volume":"148","author":"C. Gla\u00dfer","year":"2005","unstructured":"Gla\u00dfer, C., Reith, S., Vollmer, H.: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics\u00a0148, 1\u201312 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01840353","volume":"2","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica\u00a02, 113\u2013129 (1987)","journal-title":"Algorithmica"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Information Processing Letters\u00a070, 39\u201345 (1999)","journal-title":"Information Processing Letters"},{"key":"17_CR11","unstructured":"Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. PhD thesis, MIT (1996)"},{"key":"17_CR12","unstructured":"Kochetov, Y., Ivanenko, D.: Computationally difficult instances for the uncapacitated facility location problem. In: Proc. of the 5th Metaheuristic Conf., MIC 2003 (2003)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J. Kratica","year":"2001","unstructured":"Kratica, J., Toic, D., Filipovi, V., Ljubi, I.: Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res.\u00a035, 127\u2013142 (2001)","journal-title":"RAIRO Oper. Res."},{"key":"17_CR14","unstructured":"L.A.N.Lorena-instancias, http:\/\/www.lac.inpe.br\/~lorena\/instancias.html"},{"key":"17_CR15","first-page":"57","volume":"64","author":"S. Masuyama","year":"1981","unstructured":"Masuyama, S., Ibaraki, T., Hasegawa, T.: Computational complexity of the m-center problems on the plane. Trans. of the Inst. of Electron. and Commun. Eng. of Japan. Sect. E\u00a064, 57\u201364 (1981)","journal-title":"Trans. of the Inst. of Electron. and Commun. Eng. of Japan. Sect. E"},{"key":"17_CR16","unstructured":"OR-Library, http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1111\/j.1475-3995.2007.00593.x","volume":"14","author":"M.A. Pereira","year":"2007","unstructured":"Pereira, M.A., Lorena, L.A.N., Senne, E.L.F.: A column generation approach for the maximal covering location problem. Int. Trans. in Oper. Res.\u00a014, 349\u2013364 (2007)","journal-title":"Int. Trans. in Oper. Res."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J.\u00a0Comput. Syst. Sci.\u00a037, 130\u2013143 (1988)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximations algorithms. In: FOCS 2001, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"},{"key":"17_CR21","unstructured":"UflLib, http:\/\/www.mpi-inf.mpg.de\/departments\/d1\/projects\/benchmarks\/UflLib\/"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:33Z","timestamp":1606186953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}