{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:21:18Z","timestamp":1778278878126,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993647","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["A general framework for graph sparsification"],"prefix":"10.1145","author":[{"given":"Wai Shing","family":"Fung","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Hariharan","sequence":"additional","affiliation":[{"name":"Strand Life Sciences, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas J.A.","family":"Harvey","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873633"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536451"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"e_1_3_2_2_4_1","volume-title":"Randomized approximation schemes for cuts and flows in capacitated graphs","author":"Bencz\u00far A. A.","year":"2002","unstructured":"A. A. Bencz\u00far and D. R. Karger . Randomized approximation schemes for cuts and flows in capacitated graphs , 2002 . http:\/\/arxiv.org\/abs\/cs\/0207078. A. A. Bencz\u00far and D. R. Karger. Randomized approximation schemes for cuts and flows in capacitated graphs, 2002. http:\/\/arxiv.org\/abs\/cs\/0207078."},{"key":"e_1_3_2_2_5_1","volume-title":"Perfect matchings in ~O(n<sup>1.5<\/sup>) time in regular bipartite graphs","author":"Goel A.","year":"2009","unstructured":"A. Goel , M. Kapralov , and S. Khanna . Perfect matchings in ~O(n<sup>1.5<\/sup>) time in regular bipartite graphs , 2009 . http:\/\/arxiv.org\/abs\/0902.1617. A. Goel, M. Kapralov, and S. Khanna. Perfect matchings in ~O(n<sup>1.5<\/sup>) time in regular bipartite graphs, 2009. http:\/\/arxiv.org\/abs\/0902.1617."},{"key":"e_1_3_2_2_6_1","volume-title":"A randomized rounding algorithm for the asymmetric traveling salesman problem","author":"Goemans M. X.","year":"2009","unstructured":"M. X. Goemans , N. J. A. Harvey , K. Jain , and M. Singh . A randomized rounding algorithm for the asymmetric traveling salesman problem , 2009 . http:\/\/arxiv.org\/abs\/0909.0941. M. X. Goemans, N. J. A. Harvey, K. Jain, and M. Singh. A randomized rounding algorithm for the asymmetric traveling salesman problem, 2009. http:\/\/arxiv.org\/abs\/0909.0941."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496834"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/42372.42381"},{"key":"e_1_3_2_2_9_1","first-page":"21","volume-title":"Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karger D. R.","year":"1993","unstructured":"D. R. Karger . Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm . In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 21 -- 30 , 1993 . D. R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 21--30, 1993."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195422"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.2.383"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298340"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509918"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538903"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70504-1"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.30"},{"key":"e_1_3_2_2_19_1","volume-title":"Randomized Algorithms","author":"Motwani R.","year":"1997","unstructured":"R. Motwani and P. Raghavan . Randomized Algorithms . Cambridge University Press , 1997 . R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1997."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/080715093"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.66"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_2_27_1","volume-title":"Spectral sparsification of graphs","author":"Spielman D. A.","year":"2008","unstructured":"D. A. Spielman and S.-H. Teng . Spectral sparsification of graphs , 2008 . http:\/\/arxiv.org\/abs\/0808.4134. D. A. Spielman and S.-H. Teng. Spectral sparsification of graphs, 2008. http:\/\/arxiv.org\/abs\/0808.4134."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":27,"alternative-id":["10.1145\/1993636.1993647","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993647","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}