{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T05:12:24Z","timestamp":1751951544234,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806699","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"57-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Subgraph sparsification and nearly optimal ultrasparsifiers"],"prefix":"10.1145","author":[{"given":"Alexandra","family":"Kolla","sequence":"first","affiliation":[{"name":"IAS, Princeton, NJ, USA"}]},{"given":"Yury","family":"Makarychev","sequence":"additional","affiliation":[{"name":"TTI-C, Chicago, IL, USA"}]},{"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[{"name":"Stanford, Stanford, CA, USA"}]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[{"name":"USC, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.62"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536451"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"volume-title":"Proceedings of the 45th conference on Decision and Control,2006","author":"Ghosh A.","key":"e_1_3_2_1_5_1","unstructured":"A. Ghosh and S. Boyd . Growing well-connected graphs . In Proceedings of the 45th conference on Decision and Control,2006 . A. Ghosh and S. Boyd. Growing well-connected graphs. In Proceedings of the 45th conference on Decision and Control,2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10534"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060665"},{"key":"e_1_3_2_1_8_1","volume-title":"3rd. Edition","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan . Matrix Computations , 3rd. Edition . The Johns Hopkins University Press , Baltimore, MD , 1996 . G. H. Golub and C. F. Van Loan. Matrix Computations, 3rd. Edition.The Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645452"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_3_2_1_12_1","unstructured":"D. G. Luenberger.A Combined Penalty Function and Gradient Projection Method for Nonlinear Programming. http:\/\/www.stanford.edu\/dept\/MSandE\/people\/faculty\/luenberger\/articles\/acpfagpmfnp.pdf  D. G. Luenberger.A Combined Penalty Function and Gradient Projection Method for Nonlinear Programming. http:\/\/www.stanford.edu\/dept\/MSandE\/people\/faculty\/luenberger\/articles\/acpfagpmfnp.pdf"},{"issue":"1","key":"e_1_3_2_1_13_1","first-page":"39","article-title":"Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators","volume":"24","author":"Margulis A.","year":"1988","unstructured":". A. Margulis . Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators . In Problems of Information Transmission , 24 ( 1 ): 39 -- 46 , July 1988 . . A. Margulis. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. In Problems of Information Transmission,24(1):39--46, July 1988.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01647331"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.09.001"},{"key":"e_1_3_2_1_16_1","unstructured":"D. A. Spielman. Personal Communication.  D. A. Spielman. Personal Communication."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_1_19_1","unstructured":"D. A. Spielman and S. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems. CoRR abs\/cs\/0607105 2008.Available at http:\/\/www.arxiv.org\/abs\/cs.NA\/0607105.  D. A. Spielman and S. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems. CoRR abs\/cs\/0607105 2008.Available at http:\/\/www.arxiv.org\/abs\/cs.NA\/0607105."},{"key":"e_1_3_2_1_20_1","volume-title":"Spectral sparsification of graphs. CoRR,abs\/0808.4134","author":"Spielman D. A.","year":"2008","unstructured":"D. A. Spielman and S. Teng . Spectral sparsification of graphs. CoRR,abs\/0808.4134 , 2008 . Available at http:\/\/arxiv.org\/abs\/0808.4134. D. A. Spielman and S. Teng. Spectral sparsification of graphs. CoRR,abs\/0808.4134, 2008. Available at http:\/\/arxiv.org\/abs\/0808.4134."},{"key":"e_1_3_2_1_21_1","unstructured":"D. A. Spielman and J. O. Woo. A note on preconditioning with low stretch spanning trees. http:\/\/arxiv.org\/abs\/0903.2816.  D. A. Spielman and J. O. Woo. A note on preconditioning with low stretch spanning trees. http:\/\/arxiv.org\/abs\/0903.2816."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":20,"alternative-id":["10.1145\/1806689.1806699","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806699","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}