{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:50:52Z","timestamp":1781077852333,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["617951"],"award-info":[{"award-number":["617951"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["639.023.812"],"award-info":[{"award-number":["639.023.812"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316313","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"1125-1135","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On a generalization of iterated and randomized rounding"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"CWI, Netherlands \/ Eindhoven University of Technology, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Nima Anari and Shayan Oveis Gharan. 2015.  Nima Anari and Shayan Oveis Gharan. 2015."},{"key":"e_1_3_2_1_2_1","unstructured":"Effective-Resistance-Reducing Flows Spectrally Thin Trees and Asymmetric TSP. In Foundations of Computer Science FOCS. 20\u201339.  Effective-Resistance-Reducing Flows Spectrally Thin Trees and Asymmetric TSP. In Foundations of Computer Science FOCS. 20\u201339."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100271"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873633"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Arash Asadpour and Amin Saberi. 2010.  Arash Asadpour and Amin Saberi. 2010.","DOI":"10.1007\/JHEP08(2010)106"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/080723491"},{"key":"e_1_3_2_1_7_1","unstructured":"Wojciech Banaszczyk. 1998.  Wojciech Banaszczyk. 1998."},{"key":"e_1_3_2_1_8_1","volume-title":"Random Struct. Algorithms 12, 4","author":"Balancing","year":"1998","unstructured":"Balancing vectors and Gaussian measures of ndimensional convex bodies. Random Struct. Algorithms 12, 4 ( 1998 ), 351\u2013360. Balancing vectors and Gaussian measures of ndimensional convex bodies. Random Struct. Algorithms 12, 4 (1998), 351\u2013360."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_1_10_1","unstructured":"Nikhil Bansal Daniel Dadush and Shashwat Garg. 2016.  Nikhil Bansal Daniel Dadush and Shashwat Garg. 2016."},{"key":"e_1_3_2_1_11_1","unstructured":"An Algorithm for Koml\u00f3s Conjecture Matching Banaszczyk\u2019s Bound. In Foundations of Computer Science FOCS. 788\u2013799.  An Algorithm for Koml\u00f3s Conjecture Matching Banaszczyk\u2019s Bound. In Foundations of Computer Science FOCS. 788\u2013799."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055490"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1957995.1958005"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33461-5_31"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00618-8"},{"key":"e_1_3_2_1_17_1","unstructured":"St\u00e9phane Boucheron G\u00e1bor Lugosi and Pascal Massart. 2013.  St\u00e9phane Boucheron G\u00e1bor Lugosi and Pascal Massart. 2013."},{"key":"e_1_3_2_1_18_1","volume-title":"A Nonasymptotic Theory of Independence","author":"Inequalities Concentration","unstructured":"Concentration Inequalities : A Nonasymptotic Theory of Independence . Oxford University Press . Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press."},{"key":"e_1_3_2_1_19_1","unstructured":"Chandra Chekuri Jan Vondrak and Rico Zenklusen. 2010.  Chandra Chekuri Jan Vondrak and Rico Zenklusen. 2010."},{"key":"e_1_3_2_1_20_1","unstructured":"Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. In Foundations of Computer Science FOCS. 575\u2013584.  Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. In Foundations of Computer Science FOCS. 575\u2013584."},{"key":"e_1_3_2_1_21_1","unstructured":"Chandra Chekuri Jan Vondrak and Rico Zenklusen. 2011.  Chandra Chekuri Jan Vondrak and Rico Zenklusen. 2011."},{"key":"e_1_3_2_1_22_1","volume-title":"Dependent Rounding. In ACM-SIAM Symposium on Discrete Algorithms, SODA. 1080\u20131097","author":"Matroid Matchings","unstructured":"Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. In ACM-SIAM Symposium on Discrete Algorithms, SODA. 1080\u20131097 . Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. In ACM-SIAM Symposium on Discrete Algorithms, SODA. 1080\u20131097."},{"key":"e_1_3_2_1_23_1","volume-title":"Dubhashi and Alessandro Panconesi","author":"Devdatt","year":"2009","unstructured":"Devdatt P. Dubhashi and Alessandro Panconesi . 2009 . Devdatt P. Dubhashi and Alessandro Panconesi. 2009."},{"key":"e_1_3_2_1_24_1","unstructured":"Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press.   Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"key":"e_1_3_2_1_26_1","volume-title":"Harvey and Neil Olver","author":"Nicholas J.","year":"2014","unstructured":"Nicholas J. A. Harvey and Neil Olver . 2014 . Pipage Rounding, Pessimistic Estimators and Matrix Concentration. In ACM-SIAM Symposium on Discrete Algorithms, SODA. 926\u2013945. Nicholas J. A. Harvey and Neil Olver. 2014. Pipage Rounding, Pessimistic Estimators and Matrix Concentration. In ACM-SIAM Symposium on Discrete Algorithms, SODA. 926\u2013945."},{"key":"e_1_3_2_1_27_1","unstructured":"Kamal Jain. 2001.  Kamal Jain. 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"39\u201360","author":"Approximation A Factor","year":"2001","unstructured":"A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem . Combinatorica 21, 1 ( 2001 ), 39\u201360 . A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Combinatorica 21, 1 (2001), 39\u201360."},{"key":"e_1_3_2_1_29_1","volume-title":"Lap Chi Lau, and Mohit Singh","author":"Kir\u00e1ly Tam\u00e1s","year":"2008","unstructured":"Tam\u00e1s Kir\u00e1ly , Lap Chi Lau, and Mohit Singh . 2008 . Degree Bounded Matroids and Submodular Flows. In Integer Programming and Combinatorial Optimization, IPCO. 259\u2013272. Tam\u00e1s Kir\u00e1ly, Lap Chi Lau, and Mohit Singh. 2008. Degree Bounded Matroids and Submodular Flows. In Integer Programming and Combinatorial Optimization, IPCO. 259\u2013272."},{"key":"e_1_3_2_1_30_1","unstructured":"Lap-Chi Lau R. Ravi and Mohit Singh. 2011.  Lap-Chi Lau R. Ravi and Mohit Singh. 2011."},{"key":"e_1_3_2_1_31_1","unstructured":"Iterative Methods in Combinatorial Optimization. Cambridge University Press.   Iterative Methods in Combinatorial Optimization. Cambridge University Press."},{"key":"e_1_3_2_1_32_1","unstructured":"Jan Karel Lenstra David B. Shmoys and \u00c9va Tardos. 1990.  Jan Karel Lenstra David B. Shmoys and \u00c9va Tardos. 1990."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(86)80041-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.23"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.02.005"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.533200"},{"key":"e_1_3_2_1_38_1","unstructured":"On a Generalization of Iterated and Randomized Rounding STOC \u201919 June 23\u201326 2019 Phoenix AZ USA  On a Generalization of Iterated and Randomized Rounding STOC \u201919 June 23\u201326 2019 Phoenix AZ USA"},{"key":"e_1_3_2_1_39_1","volume-title":"Vishnoi","author":"Peres Yuval","year":"2017","unstructured":"Yuval Peres , Mohit Singh , and Nisheeth K . Vishnoi . 2017 . Yuval Peres, Mohit Singh, and Nisheeth K. Vishnoi. 2017."},{"key":"e_1_3_2_1_40_1","unstructured":"Random Walks in Polytopes and Negative Dependence. In Innovations in Theoretical Computer Science ITCS. 50:1\u201350:10.  Random Walks in Polytopes and Negative Dependence. In Innovations in Theoretical Computer Science ITCS. 50:1\u201350:10."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095148"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250887"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591803"},{"key":"e_1_3_2_1_44_1","unstructured":"Aravind Srinivasan. 2001.  Aravind Srinivasan. 2001."},{"key":"e_1_3_2_1_45_1","unstructured":"Distributions on Level-Sets with Applications to Approximation Algorithms. In Foundations of Computer Science FOCS. 588\u2013597.  Distributions on Level-Sets with Applications to Approximation Algorithms. In Foundations of Computer Science FOCS. 588\u2013597."},{"key":"e_1_3_2_1_46_1","volume-title":"V\u00e9gh","author":"Svensson Ola","year":"2018","unstructured":"Ola Svensson , Jakub Tarnawski , and L\u00e1szl\u00f3 A . V\u00e9gh . 2018 . Ola Svensson, Jakub Tarnawski, and L\u00e1szl\u00f3 A. V\u00e9gh. 2018."},{"key":"e_1_3_2_1_47_1","volume-title":"Symposium on Theory of Computing, STOC. 204\u2013213","author":"A","unstructured":"A constant-factor approximation algorithm for the asymmetric traveling salesman problem . In Symposium on Theory of Computing, STOC. 204\u2013213 . A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In Symposium on Theory of Computing, STOC. 204\u2013213."},{"key":"e_1_3_2_1_48_1","unstructured":"Vijay V. Vazirani. 2001.  Vijay V. Vazirani. 2001."},{"key":"e_1_3_2_1_49_1","unstructured":"Approximation algorithms. Springer.  Approximation algorithms. Springer."},{"key":"e_1_3_2_1_50_1","unstructured":"David Williamson and David Shmoys. 2011.  David Williamson and David Shmoys. 2011."},{"key":"e_1_3_2_1_51_1","unstructured":"The design of Approximation Algorithms. Cambridge University Press.   The design of Approximation Algorithms. Cambridge University Press."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:00Z","timestamp":1750204440000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":51,"alternative-id":["10.1145\/3313276.3316313","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316313","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}