{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:11Z","timestamp":1794516731118,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":16,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_327","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:30Z","timestamp":1461269010000},"page":"1753-1757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Rounding"],"prefix":"10.1007","author":[{"given":"Rajmohan","family":"Rajaraman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"327_CR1890","volume-title":"The probabilistic method","author":"N Alon","year":"1991","unstructured":"Alon N, Spencer JH (1991) The probabilistic method. Wiley, New York"},{"key":"327_CR1891","doi-asserted-by":"crossref","unstructured":"Andrews M, Zhang L (2005) Hardness of the undirected congestion minimization problem. In: STOC\u201905: proceedings of the thirty-seventh annual ACM symposium on theory of computing. ACM, New York, pp 284\u2013293","DOI":"10.1145\/1060590.1060633"},{"key":"327_CR1892","doi-asserted-by":"crossref","unstructured":"Arora S, Rao S, Vazirani UV (2004) Expander flows, geometric embeddings and graph partitioning. In: STOC, pp 222\u2013231","DOI":"10.1145\/1007352.1007355"},{"issue":"3","key":"327_CR1893","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G Calinescu","year":"2000","unstructured":"Calinescu G, Karloff HJ, Rabani Y (2000) An improved approximation algorithm for multiway cut. J Comput Syst Sci 60(3):564\u2013574","journal-title":"J Comput Syst Sci"},{"key":"327_CR1894","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff H (1952) A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23:493\u2013509","journal-title":"Ann Math Stat"},{"key":"327_CR1895","doi-asserted-by":"crossref","unstructured":"Chuzhoy J, Guruswami V, Khanna S, Talwar K (2007) Hardness of routing with congestion in directed graphs. In: STOC\u201907: proceedings of the thirty-ninth annual ACM symposium on theory of computing. ACM, New York, pp 165\u2013178","DOI":"10.1145\/1250790.1250816"},{"key":"327_CR1896","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"MX Goemans","year":"1994","unstructured":"Goemans MX, Williamson DP (1994) New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM J Discret Math 7:656\u2013666","journal-title":"SIAM J Discret Math"},{"issue":"6","key":"327_CR1897","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"key":"327_CR1898","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V Guruswami","year":"2003","unstructured":"Guruswami V, Khanna S, Rajaraman R, Shepherd B, Yannakakis M (2003) Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J Comput Syst Sci 67:473\u2013496","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"327_CR1899","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum DS (1982) Approximation algorithms for the set covering and vertex cover problems. SIAM J Comput 11(3):555\u2013556","journal-title":"SIAM J Comput"},{"key":"327_CR18100","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1214\/aoms\/1177728178","volume":"27","author":"W Hoeffding","year":"1956","unstructured":"Hoeffding W (1956) On the distribution of the number of successes in independent trials. Ann Math Stat 27:713\u2013721","journal-title":"Ann Math Stat"},{"key":"327_CR18101","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"327_CR18102","first-page":"191","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan LG (1979) A polynomial algorithm for linear programming. Sov Math Dokl 20:191\u2013194","journal-title":"Sov Math Dokl"},{"key":"327_CR18103","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan P, Thompson C (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7","journal-title":"Combinatorica"},{"key":"327_CR18104","doi-asserted-by":"crossref","unstructured":"Srinivasan A (1995) Improved approximations of packing and covering problems. In: Proceedings of the 27th annual ACM symposium on theory of computing, pp 268\u2013276","DOI":"10.1145\/225058.225138"},{"key":"327_CR18105","doi-asserted-by":"crossref","unstructured":"Vazirani V (2003) Approximation algorithms. Springer","DOI":"10.1007\/978-3-662-04565-7"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:51:28Z","timestamp":1792108288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_327","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}