{"id":"https://openalex.org/W2951040439","doi":"https://doi.org/10.1137/16m1079336","title":"Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs","display_name":"Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2951040439","doi":"https://doi.org/10.1137/16m1079336","mag":"2951040439"},"language":"en","primary_location":{"id":"doi:10.1137/16m1079336","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1079336","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019690129","display_name":"Kent Quanrud","orcid":null},"institutions":[{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kent Quanrud","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040577923"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I71561298"],"apc_list":null,"apc_paid":null,"fwci":12.1166,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.98517592,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"6","first_page":"1712","last_page":"1744"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/mathematics","display_name":"Mathematics","score":0.6802431344985962},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.677719235420227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.664389967918396},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5380529761314392},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5132765769958496},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5034944415092468},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5008883476257324},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4366971254348755},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4241708815097809},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4199102222919464},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41124987602233887},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36199402809143066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33701688051223755},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13928809762001038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13806411623954773}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6802431344985962},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.677719235420227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.664389967918396},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5380529761314392},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5132765769958496},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5034944415092468},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5008883476257324},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4366971254348755},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4241708815097809},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4199102222919464},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41124987602233887},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36199402809143066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33701688051223755},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13928809762001038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13806411623954773},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1079336","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1079336","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G179613736","display_name":"AF:  Small:  Towards better geometric algorithms: Summarizing, partitioning and shrinking data","funder_award_id":"1421231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6271038849","display_name":"AF: Small:  Efficient Proximity and Similarity Search in Computational Geometry","funder_award_id":"1217462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G736274355","display_name":null,"funder_award_id":"CCF-1421231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7864877588","display_name":null,"funder_award_id":"CCF-1217462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W806373222","https://openalex.org/W1484040084","https://openalex.org/W1500577298","https://openalex.org/W1521891106","https://openalex.org/W1581277026","https://openalex.org/W1606162993","https://openalex.org/W1773544278","https://openalex.org/W1930019869","https://openalex.org/W1949681721","https://openalex.org/W1965907328","https://openalex.org/W1978747958","https://openalex.org/W1979682819","https://openalex.org/W1979838628","https://openalex.org/W1982180670","https://openalex.org/W1985572324","https://openalex.org/W1987221468","https://openalex.org/W1987374783","https://openalex.org/W1995725694","https://openalex.org/W1999396007","https://openalex.org/W2013522700","https://openalex.org/W2018541722","https://openalex.org/W2023041062","https://openalex.org/W2027823875","https://openalex.org/W2028738060","https://openalex.org/W2030279496","https://openalex.org/W2031149390","https://openalex.org/W2035850501","https://openalex.org/W2038643780","https://openalex.org/W2039079162","https://openalex.org/W2063572899","https://openalex.org/W2067431706","https://openalex.org/W2068019092","https://openalex.org/W2075921069","https://openalex.org/W2077571023","https://openalex.org/W2077735330","https://openalex.org/W2078013630","https://openalex.org/W2081254453","https://openalex.org/W2083352539","https://openalex.org/W2094511120","https://openalex.org/W2099698406","https://openalex.org/W2099819831","https://openalex.org/W2119142868","https://openalex.org/W2120424341","https://openalex.org/W2124937241","https://openalex.org/W2133311553","https://openalex.org/W2140049544","https://openalex.org/W2154745646","https://openalex.org/W2156760067","https://openalex.org/W2170429689","https://openalex.org/W2235179049","https://openalex.org/W2295092485","https://openalex.org/W2400113642","https://openalex.org/W2401610261","https://openalex.org/W2486715098","https://openalex.org/W2525451309","https://openalex.org/W2762935521","https://openalex.org/W2912202394","https://openalex.org/W2953141865","https://openalex.org/W2963755366","https://openalex.org/W3030774092","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2383959219","https://openalex.org/W2054473698","https://openalex.org/W2147086810","https://openalex.org/W3037291746","https://openalex.org/W3004945501","https://openalex.org/W4244934433","https://openalex.org/W2007607373","https://openalex.org/W2073435288","https://openalex.org/W2952838392"],"abstract_inverted_index":{"We":[0,39,108],"investigate":[1],"the":[2,31,86,91,95],"family":[3,17,32],"of":[4,7,30,33,76,113,117],"intersection":[5],"graphs":[6,34,47],"low":[8,12],"density":[9],"objects":[10],"in":[11,25,85],"dimensional":[13],"Euclidean":[14],"space.":[15],"This":[16],"is":[18,27,134],"quite":[19],"general,":[20],"includes":[21],"planar":[22],"graphs,":[23],"and":[24,54,60],"particular":[26],"a":[28],"subset":[29],"that":[35,132],"have":[36,82],"polynomial":[37,45],"expansion.":[38],"present":[40],"efficient":[41],"$(1+\\varepsilon)$-approximation":[42],"algorithms":[43,93],"for":[44,48,69,74,99,115,137,152],"expansion":[46],"unweighted":[49],"Independent":[50],"Set,":[51],"Set":[52,56],"Cover,":[53],"Dominating":[55],"problems,":[57,120],"among":[58],"others,":[59],"these":[61,70,118],"results":[62,81],"seem":[63],"to":[64,126,157],"be":[65],"new.":[66],"Naturally,":[67],"PTASs":[68],"problems":[71],"are":[72,106,145],"known":[73,98],"subclasses":[75],"this":[77,153],"graph":[78],"family.":[79],"These":[80],"immediate":[83],"applications":[84],"geometric":[87],"domain.":[88],"For":[89,128],"example,":[90,129],"new":[92],"yield":[94],"only":[96],"PTAS":[97,136,151],"covering":[100,138],"points":[101,139],"by":[102,140],"fat":[103,141],"triangles":[104,142],"(that":[105],"shallow).":[107],"also":[109],"prove":[110],"corresponding":[111],"hardness":[112],"approximation":[114],"some":[116],"optimization":[119],"characterizing":[121],"their":[122],"intractability":[123],"with":[124,155],"respect":[125,156],"density.":[127],"we":[130],"show":[131],"there":[133],"no":[135],"if":[143],"they":[144],"not":[146],"shallow,":[147],"thus":[148],"matching":[149],"our":[150],"problem":[154],"depth.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}