{"id":"https://openalex.org/W2235179049","doi":"https://doi.org/10.1145/2831230","title":"Net and Prune","display_name":"Net and Prune","publication_year":2015,"publication_date":"2015-12-10","ids":{"openalex":"https://openalex.org/W2235179049","doi":"https://doi.org/10.1145/2831230","mag":"2235179049"},"language":"en","primary_location":{"id":"doi:10.1145/2831230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2831230","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/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":["University of Illinois, Urbana-Champaign, Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054913384","display_name":"Benjamin Raichel","orcid":"https://orcid.org/0000-0001-6584-4843"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Raichel","raw_affiliation_strings":["University of Texas at Dallas, Richardson, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040577923"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":4.4261,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94256912,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"62","issue":"6","first_page":"1","last_page":"35"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6254298090934753},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.6022669672966003},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5742287635803223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5060727000236511},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5004076957702637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49259287118911743},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4860292077064514},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.43534302711486816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42848560214042664},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42538774013519287},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.423550009727478},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41945356130599976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3897477090358734},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.11274451017379761},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10747364163398743},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.083462655544281}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6254298090934753},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.6022669672966003},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5742287635803223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5060727000236511},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5004076957702637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49259287118911743},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4860292077064514},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.43534302711486816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42848560214042664},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42538774013519287},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.423550009727478},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41945356130599976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3897477090358734},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.11274451017379761},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10747364163398743},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.083462655544281},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2831230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2831230","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W108314478","https://openalex.org/W596522316","https://openalex.org/W1495721607","https://openalex.org/W1511255594","https://openalex.org/W1519444547","https://openalex.org/W1552026372","https://openalex.org/W1555007779","https://openalex.org/W1562315931","https://openalex.org/W1593563200","https://openalex.org/W1789652828","https://openalex.org/W1966685253","https://openalex.org/W1973264045","https://openalex.org/W1978906111","https://openalex.org/W1981313592","https://openalex.org/W1993058867","https://openalex.org/W2004899468","https://openalex.org/W2014732796","https://openalex.org/W2024517791","https://openalex.org/W2027823875","https://openalex.org/W2034188144","https://openalex.org/W2044118667","https://openalex.org/W2045134120","https://openalex.org/W2045964207","https://openalex.org/W2054011861","https://openalex.org/W2054788982","https://openalex.org/W2058432138","https://openalex.org/W2059541050","https://openalex.org/W2069845605","https://openalex.org/W2082371687","https://openalex.org/W2094974501","https://openalex.org/W2097004206","https://openalex.org/W2136807817","https://openalex.org/W2138237549","https://openalex.org/W2152479402","https://openalex.org/W2153874829","https://openalex.org/W2161008043","https://openalex.org/W2247953682","https://openalex.org/W2295428206","https://openalex.org/W2570995828","https://openalex.org/W2911597709","https://openalex.org/W4213012742","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W2519241726","https://openalex.org/W2375128115","https://openalex.org/W2362413895","https://openalex.org/W2368415703","https://openalex.org/W2169618946","https://openalex.org/W2158905189","https://openalex.org/W2391642054","https://openalex.org/W2797906284","https://openalex.org/W2182477562","https://openalex.org/W4319874546"],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2],"general":[3],"framework":[4,142],"for":[5],"getting":[6],"expected":[7],"linear":[8,72,146],"time":[9,73,148],"constant":[10],"factor":[11],"approximations":[12],"(and":[13],"in":[14,23,42,118],"many":[15,56],"cases":[16],"FPTAS's)":[17],"to":[18,40,139],"several":[19],"well":[20,59],"known":[21],"problems":[22,61,88,127],"Computational":[24],"Geometry,":[25],"such":[26,143],"as":[27],"k":[28,95,101,103,107,114],"-center":[29,96],"clustering":[30],"and":[31,46,52,81,121,133],"farthest":[32,92],"nearest":[33,93],"neighbor.":[34],"The":[35],"new":[36],"approach":[37],"is":[38,49],"robust":[39],"variations":[41],"the":[43,87,119,145],"input":[44],"problem,":[45],"yet":[47],"it":[48],"simple,":[50],"elegant,":[51],"practical.":[53],"In":[54],"particular,":[55],"of":[57,86],"these":[58],"studied":[60],"which":[62],"fit":[63],"easily":[64],"into":[65],"our":[66,141],"framework,":[67],"either":[68],"previously":[69],"had":[70],"no":[71],"approximation":[74],"algorithm,":[75],"or":[76],"required":[77],"rather":[78],"involved":[79],"algorithms":[80],"analysis.":[82],"A":[83],"short":[84],"list":[85],"we":[89,136],"consider":[90],"include":[91],"neighbor,":[94],"clustering,":[97],"smallest":[98,109],"disk":[99],"enclosing":[100],"points,":[102],"th":[104,108,115],"largest":[105],"distance,":[106,113],"m":[110],"-nearest":[111],"neighbor":[112],"heaviest":[116],"edge":[117],"MST":[120],"other":[122],"spanning":[123],"forest":[124],"type":[125],"problems,":[126],"involving":[128],"upward":[129],"closed":[130],"set":[131],"systems,":[132],"more.":[134],"Finally,":[135],"show":[137],"how":[138],"extend":[140],"that":[144],"running":[147],"bound":[149],"holds":[150],"with":[151],"high":[152],"probability.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}