{"id":"https://openalex.org/W2150936694","doi":"https://doi.org/10.1109/sfcs.2002.1181980","title":"On approximating the radii of point sets in high dimensions","display_name":"On approximating the radii of point sets in high dimensions","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2150936694","doi":"https://doi.org/10.1109/sfcs.2002.1181980","mag":"2150936694"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5113712448","display_name":"Kasturi Varadarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.R. Varadarajan","raw_affiliation_strings":["Department of Computer Science, University of Iowa, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":null,"display_name":"S. Venkatesh","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Venkatesh","raw_affiliation_strings":["DIMACS, Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMACS, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142","https://openalex.org/I2799411422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462844","display_name":"Jiawei Zhang","orcid":"https://orcid.org/0000-0002-8091-5045"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiawei Zhang","raw_affiliation_strings":["Department of Management Science and Engineering, University of Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science and Engineering, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5829,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.84684685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"136","issue":null,"first_page":"561","last_page":"569"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/combinatorics","display_name":"Combinatorics","score":0.7274996638298035},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6281715631484985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.594359278678894},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5651189684867859},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5339580774307251},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5065954923629761},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4895647466182709},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4585575461387634},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.44307559728622437},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.43901583552360535},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43481749296188354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.377225399017334},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15820685029029846},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09901925921440125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09539163112640381}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7274996638298035},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6281715631484985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.594359278678894},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5651189684867859},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5339580774307251},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5065954923629761},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4895647466182709},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4585575461387634},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.44307559728622437},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.43901583552360535},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43481749296188354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.377225399017334},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15820685029029846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09901925921440125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09539163112640381},{"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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/sfcs.2002.1181980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.126.7088","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.7088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uvic.ca/~venkat/papers/radii.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.1313","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.1313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiowa.edu/~kvaradar/paps/venkat.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.2882","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dollar.biz.uiowa.edu/%7Ejiazhang/venkat.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W125811033","https://openalex.org/W1485979075","https://openalex.org/W1530239281","https://openalex.org/W1556094370","https://openalex.org/W1691008300","https://openalex.org/W1934904397","https://openalex.org/W1952127226","https://openalex.org/W1970259241","https://openalex.org/W1970670479","https://openalex.org/W1970950689","https://openalex.org/W1975360289","https://openalex.org/W1978492002","https://openalex.org/W1984675750","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W1999351098","https://openalex.org/W2019578639","https://openalex.org/W2019886197","https://openalex.org/W2021680564","https://openalex.org/W2022029673","https://openalex.org/W2025190766","https://openalex.org/W2029432209","https://openalex.org/W2035321239","https://openalex.org/W2059651397","https://openalex.org/W2069172499","https://openalex.org/W2079872371","https://openalex.org/W2086486316","https://openalex.org/W2100440346","https://openalex.org/W2148352980","https://openalex.org/W2152196442","https://openalex.org/W2221440952","https://openalex.org/W2979473749","https://openalex.org/W4253418273","https://openalex.org/W6637551211"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W4299801389","https://openalex.org/W2963158951"],"abstract_inverted_index":{"Let":[0],"P":[1],"be":[2,68],"a":[3,81,97,108,164,237],"set":[4,212],"of":[5,20,35,77,93,110,166,194,209,240,242,256],"n":[6],"points":[7],"in":[8,84,265],"/spl":[9,171],"Ropf//sup":[10],"d/.":[11],"For":[12],"any":[13,117,151,170,176],"1/spl":[14,118],"les/k/spl":[15,119],"les/d,":[16],"the":[17,27,45,49,57,60,74,141,146,180,186,207,210,227,251,263],"outer":[18],"k-radius":[19],"P,":[21],"denoted":[22],"by":[23,261],"R/sub":[24,204],"k/(P),":[25],"is":[26,44,63,80,96,123,175,259],"minimum,":[28],"over":[29],"all":[30],"(d-k)":[31],"-dimensional":[32],"fiats":[33],"F,":[34],"max/sub":[36],"p/spl":[37],"isin/P/":[38],"d(p,":[39,42],"F),":[40],"where":[41],"F)":[43],"Euclidean":[46],"distance":[47],"between":[48],"point":[50,78,211],"p":[51],"and":[52,66,130,144,258],"fiat":[53],"F.":[54],"We":[55,214],"consider":[56],"scenario":[58],"when":[59,148,173],"dimension":[61,131],"d":[62],"not":[64],"fixed":[65,177],"can":[67],"as":[69,71],"large":[70,238],"n.":[72],"Computing":[73],"various":[75],"radii":[76],"sets":[79],"fundamental":[82],"problem":[83],"computational":[85],"convexity":[86],"with":[87],"many":[88],"applications.":[89],"The":[90],"main":[91],"result":[92,219,246,255],"this":[94],"paper":[95],"randomized":[98],"polynomial":[99,156],"time":[100,157],"algorithm":[101,122,232],"that":[102,159,229],"approximates":[103],"Rk":[104,222,248],"(P)":[105,249],"to":[106,162],"within":[107,163],"factor":[109,165],"O/spl":[111,199],"radic/(log":[112,200],"n/spl":[113],"middot/log":[114],"d)":[115],"for":[116,140,145,150,169,203,220,236,247],"les/d.":[120],"This":[121],"obtained":[124],"using":[125,268],"techniques":[126],"from":[127,185,271],"semidefinite":[128],"programming":[129,188],"reduction.":[132],"Previously,":[133],"good":[134],"approximation":[135,202,231],"algorithms":[136,158],"were":[137],"known":[138,253],"only":[139],"case":[142,147],"k=1":[143],"k=d-c":[149],"constant":[152],"c;":[153],"there":[154],"are":[155],"approximate":[160],"Rk(P)":[161],"(1+/spl":[167],"epsi/),":[168],"epsi/>0,":[172],"d-k":[174],"constant.":[178],"On":[179],"other":[181],"hand,":[182],"some":[183],"results":[184],"mathematical":[187],"community":[189],"on":[190],"approximating":[191],"certain":[192],"kinds":[193],"quadratic":[195],"programs":[196],"imply":[197],"an":[198,217],"n)":[201],"1/":[205],"(P),":[206,223],"width":[208],"P.":[213],"also":[215],"prove":[216],"inapproximability":[218,245],"computing":[221],"which":[224],"easily":[225],"yields":[226],"conclusion":[228],"our":[230],"performs":[233],"quite":[234],"well":[235],"range":[239],"values":[241],"k.":[243],"Our":[244],"improves":[250],"previous":[252],"hardness":[254],"Brieden,":[257],"proved":[260],"improving":[262],"parameters":[264],"Brieden's":[266],"construction":[267],"basic":[269],"ideas":[270],"PCP":[272],"theory.":[273]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}