{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:09Z","timestamp":1750220769172,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"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":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384313","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:48:36Z","timestamp":1624916916000},"page":"826-839","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A spectral approach to network design"],"prefix":"10.1145","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_5"},{"key":"e_1_3_2_1_2_1","series-title":"SIAM review, 46 ( 4 ): 667-689","volume-title":"Fastest mixing markov chain on a graph","author":"Boyd Stephen","year":"2004","unstructured":"Stephen Boyd , Persi Diaconis , and Lin Xiao . Fastest mixing markov chain on a graph . SIAM review, 46 ( 4 ): 667-689 , 2004 . Stephen Boyd, Persi Diaconis, and Lin Xiao. Fastest mixing markov chain on a graph. SIAM review, 46 ( 4 ): 667-689, 2004."},{"key":"e_1_3_2_1_3_1","volume-title":"Steiner tree approximation via iterative randomized rounding. Journal of the ACM, 60 ( 1 ): 6","author":"Byrka Jaroslaw","year":"2013","unstructured":"Jaroslaw Byrka , Fabrizio Grandoni , Thomas Rothvoss , and Laura Sanita . Steiner tree approximation via iterative randomized rounding. Journal of the ACM, 60 ( 1 ): 6 , 2013 . Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss, and Laura Sanita. Steiner tree approximation via iterative randomized rounding. Journal of the ACM, 60 ( 1 ): 6, 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"Aaron Schild, Sam Chiu-wai Wong, and Hong Zhou. Network design for s-t efective resistance. arXiv preprint arXiv:1904.03219","author":"Chan Pak Hay","year":"2019","unstructured":"Pak Hay Chan , Lap Chi Lau , Aaron Schild, Sam Chiu-wai Wong, and Hong Zhou. Network design for s-t efective resistance. arXiv preprint arXiv:1904.03219 , 2019 . Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, and Hong Zhou. Network design for s-t efective resistance. arXiv preprint arXiv:1904.03219, 2019."},{"key":"e_1_3_2_1_5_1","volume-title":"The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6 ( 4 ): 312-340","author":"Chandra Ashok K.","year":"1996","unstructured":"Ashok K. Chandra , Prabhakar Raghavan , Walter L. Ruzzo , Roman Smolensky , and Prasoon Tiwari . The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6 ( 4 ): 312-340 , 1996 . Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, and Prasoon Tiwari. The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6 ( 4 ): 312-340, 1996."},{"key":"e_1_3_2_1_6_1","series-title":"SIAM Journal on Computing, 43 ( 4 ): 1342-1362","volume-title":"Approximating minimum-cost k-node connected subgraphs via independence-free graphs","author":"Cheriyan Joseph","year":"2014","unstructured":"Joseph Cheriyan and L\u00e1szl\u00f3 A. V\u00e9gh . Approximating minimum-cost k-node connected subgraphs via independence-free graphs . SIAM Journal on Computing, 43 ( 4 ): 1342-1362 . SIAM , 2014 . Joseph Cheriyan and L\u00e1szl\u00f3 A. V\u00e9gh. Approximating minimum-cost k-node connected subgraphs via independence-free graphs. SIAM Journal on Computing, 43 ( 4 ): 1342-1362. SIAM, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0016-z"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993646"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301447"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591837"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959908"},{"key":"e_1_3_2_1_13_1","volume-title":"On tail probabilities for martingales. Annals of Probability, 3 ( 1 ): 100-118","author":"Freedman David A.","year":"1975","unstructured":"David A. Freedman . On tail probabilities for martingales. Annals of Probability, 3 ( 1 ): 100-118 , 1975 . David A. Freedman. On tail probabilities for martingales. Annals of Probability, 3 ( 1 ): 100-118, 1975."},{"key":"e_1_3_2_1_14_1","first-page":"1202","volume":"44","author":"Fukunaga Takuro","unstructured":"Takuro Fukunaga , Zeev Nutov , and R. Ravi . Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. SIAM Journal on Computing , 44 ( 5 ): 1202 - 1229 , 2015. Takuro Fukunaga, Zeev Nutov, and R. Ravi. Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. SIAM Journal on Computing, 44 ( 5 ): 1202-1229, 2015.","journal-title":"Computing"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_29"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20289"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"e_1_3_2_1_20_1","series-title":"SIAM review, 50 ( 1 ): 37-66","volume-title":"Minimizing efective resistance of a graph","author":"Ghosh Arpita","year":"2008","unstructured":"Arpita Ghosh , Stephen Boyd , and Amin Saberi . Minimizing efective resistance of a graph . SIAM review, 50 ( 1 ): 37-66 , 2008 . Arpita Ghosh, Stephen Boyd, and Amin Saberi. Minimizing efective resistance of a graph. SIAM review, 50 ( 1 ): 37-66, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/314464.314497"},{"key":"e_1_3_2_1_23_1","first-page":"296","volume":"24","author":"Goemans Michel X.","unstructured":"Michel X. Goemans and David P. Williamson . A general approximation technique for constrained forest problems. SIAM Journal on Computing , 24 ( 2 ): 296 - 317 , 1995. Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24 ( 2 ): 296-317, 1995.","journal-title":"Computing"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC), 253-264","author":"Grandoni Fabrizio","year":"2019","unstructured":"Fabrizio Grandoni , Bundit Laekhanukit , and Shi Li. (log2 \/log log )-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm . In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC), 253-264 . ACM, 2019 . Fabrizio Grandoni, Bundit Laekhanukit, and Shi Li. (log2 \/log log )-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC), 253-264. ACM, 2019."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806699"},{"key":"e_1_3_2_1_27_1","volume-title":"Four deviations sufice for rank 1 matrices. arXiv preprint arXiv","author":"Kyng Rasmus","year":"1901","unstructured":"Rasmus Kyng , Kyle Luh , Zhao Song . Four deviations sufice for rank 1 matrices. arXiv preprint arXiv : 1901 .06731, 2019. Rasmus Kyng, Kyle Luh, Zhao Song. Four deviations sufice for rank 1 matrices. arXiv preprint arXiv: 1901.06731, 2019."},{"key":"e_1_3_2_1_28_1","first-page":"1062","volume":"39","author":"Lau Lap Chi","unstructured":"Lap Chi Lau , Joseph Naor , Mohammad R. Salavatipour , and Mohit Singh . Survivable network design with degree or order constraints. SIAM Journal on Computing , 39 ( 3 ): 1062 - 1087 , 2009. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, and Mohit Singh. Survivable network design with degree or order constraints. SIAM Journal on Computing, 39 ( 3 ): 1062-1087, 2009.","journal-title":"Computing"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018773"},{"key":"e_1_3_2_1_30_1","series-title":"SIAM Journal on Computing, 42 ( 6 ): 2217-2242","volume-title":"Additive approximation for bounded degree survivable network design","author":"Lau Lap Chi","year":"2013","unstructured":"Lap Chi Lau and Mohit Singh . Additive approximation for bounded degree survivable network design . SIAM Journal on Computing, 42 ( 6 ): 2217-2242 . SIAM , 2013 . Lap Chi Lau and Mohit Singh. Additive approximation for bounded degree survivable network design. SIAM Journal on Computing, 42 ( 6 ): 2217-2242. SIAM, 2013."},{"key":"e_1_3_2_1_31_1","first-page":"1","volume":"154","author":"Lau Lap Chi","unstructured":"Lap Chi Lau and Hong Zhou . A unified algorithm for degree bounded survivable network design. Mathematical Programming , 154 ( 1 - 2 ): 515-532, 2015. Lap Chi Lau and Hong Zhou. A unified algorithm for degree bounded survivable network design. Mathematical Programming, 154 ( 1-2 ): 515-532, 2015.","journal-title":"Mathematical Programming"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055477"},{"key":"e_1_3_2_1_33_1","first-page":"2315","volume":"47","author":"Lee Yin Tat","unstructured":"Yin Tat Lee and He Sun . Constructing linear-sized spectral sparsification in almostlinear time. SIAM Journal on Computing , 47 ( 6 ): 2315 - 2336 , 2018. Yin Tat Lee and He Sun. Constructing linear-sized spectral sparsification in almostlinear time. SIAM Journal on Computing, 47 ( 6 ): 2315-2336, 2018.","journal-title":"Computing"},{"key":"e_1_3_2_1_34_1","volume-title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Mathematical Programming, 172 ( 1-2 ): 17-34","author":"Linhares Andr\u00e9","year":"2018","unstructured":"Andr\u00e9 Linhares and Chaitanya Swamy . Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Mathematical Programming, 172 ( 1-2 ): 17-34 . Springer , 2018 . Andr\u00e9 Linhares and Chaitanya Swamy. Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Mathematical Programming, 172 ( 1-2 ): 17-34. Springer, 2018."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_38"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722263"},{"key":"e_1_3_2_1_37_1","volume-title":"Interlacing families I: Bipartite Ramanujan graphs of all degrees. Annals of Mathematics, 307-325","author":"Marcus Adam W.","year":"2015","unstructured":"Adam W. Marcus , Daniel A. Spielman , Nikhil Srivastava . Interlacing families I: Bipartite Ramanujan graphs of all degrees. Annals of Mathematics, 307-325 , 2015 . Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava. Interlacing families I: Bipartite Ramanujan graphs of all degrees. Annals of Mathematics, 307-325, 2015."},{"key":"e_1_3_2_1_38_1","volume-title":"Interlacing families II: Mixed characteristic polynomials and the Kadison Singer problem. Annals of Mathematics, 327-350","author":"Marcus Adam W.","year":"2015","unstructured":"Adam W. Marcus , Daniel A. Spielman , Nikhil Srivastava . Interlacing families II: Mixed characteristic polynomials and the Kadison Singer problem. Annals of Mathematics, 327-350 , 2015 . Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava. Interlacing families II: Mixed characteristic polynomials and the Kadison Singer problem. Annals of Mathematics, 327-350, 2015."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991894"},{"key":"e_1_3_2_1_40_1","first-page":"1369","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Nikolov Aleksandar","year":"2018","unstructured":"Aleksandar Nikolov , Mohit Singh , and Uthaipon Tao Tantipongpipat . Proportional volume sampling and approximation algorithms for A-optimal design . In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1369 - 1386 . SIAM, 2018 . Aleksandar Nikolov, Mohit Singh, and Uthaipon Tao Tantipongpipat. Proportional volume sampling and approximation algorithms for A-optimal design. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1369-1386. SIAM, 2018."},{"key":"e_1_3_2_1_41_1","volume-title":"Chain-constrained spanning trees. Mathematical Programming, 167 ( 2 ): 293-314","author":"Olver Neil","year":"2018","unstructured":"Neil Olver and Rico Zenklusen . Chain-constrained spanning trees. Mathematical Programming, 167 ( 2 ): 293-314 . Springer , 2018 . Neil Olver and Rico Zenklusen. Chain-constrained spanning trees. Mathematical Programming, 167 ( 2 ): 293-314. Springer, 2018."},{"key":"e_1_3_2_1_42_1","volume-title":"Optimal design of experiments","author":"Pukelsheim Friedrich","year":"2016","unstructured":"Friedrich Pukelsheim . Optimal design of experiments . SIAM , 2016 . Friedrich Pukelsheim. Optimal design of experiments. SIAM, 2016."},{"key":"e_1_3_2_1_43_1","first-page":"266","volume-title":"Algorithms for finding low degree structures. Approximation algorithms for NP-hard problems","author":"Raghavachari Balaji","year":"1996","unstructured":"Balaji Raghavachari . Algorithms for finding low degree structures. Approximation algorithms for NP-hard problems , pages 266 - 295 , 1996 . Balaji Raghavachari. Algorithms for finding low degree structures. Approximation algorithms for NP-hard problems, pages 266-295, 1996."},{"key":"e_1_3_2_1_44_1","first-page":"58","volume":"31","author":"Ravi Ramamoorthi","unstructured":"Ramamoorthi Ravi , Madhav V. Marathe , S. S. Ravi , Daniel J. Rosenkrantz , and Harry B. Hunt III. Approximation Algorithms for Degree-Constrained MinimumCost Network-Design Problems. Algorithmica , 31 ( 1 ): 58 - 78 , 2001. Ramamoorthi Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Approximation Algorithms for Degree-Constrained MinimumCost Network-Design Problems. Algorithmica, 31 ( 1 ): 58-78, 2001.","journal-title":"Degree-Constrained MinimumCost Network-Design Problems. Algorithmica"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188852"},{"key":"e_1_3_2_1_46_1","volume-title":"Sparse Sums of Positive Semidefinite Matrices. ACM Transactions on Algorithms, 12 ( 1 ): 9","author":"Silva Marcel K.","year":"2016","unstructured":"Marcel K. Silva , Nicholas J. A. Harvey , and Cristiane M. Sato . Sparse Sums of Positive Semidefinite Matrices. ACM Transactions on Algorithms, 12 ( 1 ): 9 , 2016 Marcel K. Silva, Nicholas J. A. Harvey, and Cristiane M. Sato. Sparse Sums of Positive Semidefinite Matrices. ACM Transactions on Algorithms, 12 ( 1 ): 9, 2016"},{"key":"e_1_3_2_1_47_1","volume-title":"Approximating minimum bounded degree spanning tress to within one of optimal. Journal of the ACM, 62 ( 1 ): 1","author":"Singh Mohit","year":"2015","unstructured":"Mohit Singh and Lap Chi Lau . Approximating minimum bounded degree spanning tress to within one of optimal. Journal of the ACM, 62 ( 1 ): 1 , 2015 . Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning tress to within one of optimal. Journal of the ACM, 62 ( 1 ): 1, 2015."},{"key":"e_1_3_2_1_48_1","first-page":"1913","volume":"40","author":"Spielman Daniel A.","unstructured":"Daniel A. Spielman and Nikhil Srivastava . Graph sparsification by efective resistances. SIAM Journal on Computing , 40 ( 6 ): 1913 - 1926 , 2011. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by efective resistances. SIAM Journal on Computing, 40 ( 6 ): 1913-1926, 2011.","journal-title":"Computing"},{"key":"e_1_3_2_1_49_1","series-title":"SIAM Journal on Computing, 40 ( 4 ): 981-1025","volume-title":"Spielman and Shang-Hua Teng. Spectral sparsification of graphs","author":"Daniel","year":"2011","unstructured":"Daniel A. Spielman and Shang-Hua Teng. Spectral sparsification of graphs . SIAM Journal on Computing, 40 ( 4 ): 981-1025 . SIAM , 2011 . Daniel A. Spielman and Shang-Hua Teng. Spectral sparsification of graphs. SIAM Journal on Computing, 40 ( 4 ): 981-1025. SIAM, 2011."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959935"},{"key":"e_1_3_2_1_51_1","first-page":"262","volume":"16","author":"Tropp Joel A.","unstructured":"Joel A. Tropp . Freedman's inequality for matrix martingales. Electronic Communications in Probability , 16 : 262 - 270 , 2011. Joel A. Tropp. Freedman's inequality for matrix martingales. Electronic Communications in Probability, 16 : 262-270, 2011.","journal-title":"Probability"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:13Z","timestamp":1750200073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":51,"alternative-id":["10.1145\/3357713.3384313","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384313","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}