{"id":"https://openalex.org/W2594480752","doi":"https://doi.org/10.1145/3055399.3055477","title":"An SDP-based algorithm for linear-sized spectral sparsification","display_name":"An SDP-based algorithm for linear-sized spectral sparsification","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2594480752","doi":"https://doi.org/10.1145/3055399.3055477","mag":"2594480752"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055477","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062035495","display_name":"He Sun","orcid":"https://orcid.org/0000-0002-5852-3125"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"He Sun","raw_affiliation_strings":["University of Bristol, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.1323,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.99666228,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"678","last_page":"687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5547189712524414},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5081450939178467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5014934539794922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5002448558807373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4664183557033539},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45274290442466736}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5547189712524414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5081450939178467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5014934539794922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5002448558807373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4664183557033539},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45274290442466736}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3055399.3055477","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1800323139","https://openalex.org/W1983193888","https://openalex.org/W1997315949","https://openalex.org/W2051540665","https://openalex.org/W2067081844","https://openalex.org/W2073378277","https://openalex.org/W2073637342","https://openalex.org/W2096908304","https://openalex.org/W2121689290","https://openalex.org/W2129027292","https://openalex.org/W2129575457","https://openalex.org/W2139391136","https://openalex.org/W2295766446","https://openalex.org/W2951676025","https://openalex.org/W2962739990","https://openalex.org/W2963098024","https://openalex.org/W2963841171"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W1994341438"],"abstract_inverted_index":{"For":[0],"any":[1],"undirected":[2],"and":[3,10],"weighted":[4],"graph":[5],"G=(V,E,w)":[6],"with":[7,21],"n":[8],"vertices":[9],"m":[11],"edges,":[12,26],"we":[13],"call":[14],"a":[15,27],"sparse":[16],"subgraph":[17],"H":[18],"of":[19,24],"G,":[20],"proper":[22],"reweighting":[23],"the":[25],"(1+\u00ce\u00b5)-spectral":[28],"sparsifier":[29],"if":[30]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}