{"id":"https://openalex.org/W2952741770","doi":"https://doi.org/10.1142/s0218195914600073","title":"ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS","display_name":"ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2952741770","doi":"https://doi.org/10.1142/s0218195914600073","mag":"2952741770"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195914600073","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195914600073","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1306.3452","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"WOLFGANG MULZER","orcid":null},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"WOLFGANG MULZER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":null,"display_name":"YANNIK STEIN","orcid":null},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"YANNIK STEIN","raw_affiliation_strings":["Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I75951250"],"apc_list":null,"apc_paid":null,"fwci":0.7849,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82840628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"04","first_page":"261","last_page":"273"},"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.76910001039505,"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.76910001039505,"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.07010000199079514,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.018200000748038292,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.762499988079071},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5203999876976013},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4722000062465668},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4246000051498413},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3874000012874603},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.33959999680519104}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8022000193595886},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.762499988079071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104999780654907},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5203999876976013},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4722000062465668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36579999327659607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26190000772476196}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218195914600073","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195914600073","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1306.3452","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.3452","pdf_url":"https://arxiv.org/pdf/1306.3452","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1306.3452","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.3452","pdf_url":"https://arxiv.org/pdf/1306.3452","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1971444741","https://openalex.org/W1977098616","https://openalex.org/W1980414131","https://openalex.org/W2004331157","https://openalex.org/W2076053977","https://openalex.org/W2086902521","https://openalex.org/W2104130541","https://openalex.org/W2162144048","https://openalex.org/W2166505687","https://openalex.org/W2215397208"],"related_works":[],"abstract_inverted_index":{"Let":[0],"P":[1,13],"be":[2,102,112],"a":[3,16,47,65,130,150],"d-dimensional":[4],"n-point":[5],"set.":[6],"A":[7],"partition":[8,18,49,68,153],"[Formula:":[9,27,39],"see":[10,28,40],"text]":[11,29,41],"of":[12,23],"is":[14,42,63,145,154],"called":[15],"Tverberg":[17,48,67,135,152],"if":[19,44],"the":[20,98,108,123,133],"convex":[21],"hulls":[22],"all":[24],"sets":[25],"in":[26,31,114],"intersect":[30],"at":[32],"least":[33],"one":[34],"point.":[35],"We":[36],"say":[37],"that":[38,61,97,143],"t-tolerant":[43,66],"it":[45,144],"remains":[46],"after":[50],"deleting":[51],"any":[52],"t":[53],"points":[54],"from":[55],"P.":[56],"Sober\u00f3n":[57],"and":[58,104],"Strausz":[59],"proved":[60],"there":[62],"always":[64],"with":[69],"\u2308n/(d":[70],"+":[71,73],"1)(t":[72],"1)\u2309":[74],"sets.":[75],"However,":[76],"no":[77,138],"nontrivial":[78],"algorithms":[79],"for":[80],"computing":[81],"or":[82],"approximating":[83],"such":[84],"partitions":[85,110],"have":[86],"been":[87],"presented":[88],"so":[89],"far.":[90],"For":[91,117],"d":[92,118],"\u2264":[93],"2,":[94],"we":[95,105,121,141],"show":[96,106,142],"Sober\u00f3n-Strausz":[99],"bound":[100],"can":[101,111],"improved,":[103],"how":[107],"corresponding":[109],"found":[113],"polynomial":[115],"time.":[116],"\u2265":[119],"3,":[120],"give":[122],"first":[124],"polynomial-time":[125],"approximation":[126],"algorithm":[127],"by":[128],"presenting":[129],"reduction":[131],"to":[132,147],"regular":[134],"problem":[136],"(with":[137],"tolerance).":[139],"Finally,":[140],"coNP-complete":[146],"determine":[148],"whether":[149],"given":[151],"t-tolerant.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-06-27T00:00:00"}