{"id":"https://openalex.org/W2076075314","doi":"https://doi.org/10.1137/060656309","title":"On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model","display_name":"On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2076075314","doi":"https://doi.org/10.1137/060656309","mag":"2076075314"},"language":"en","primary_location":{"id":"doi:10.1137/060656309","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060656309","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/A5000432625","display_name":"Nir Halman","orcid":"https://orcid.org/0000-0002-6098-9792"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nir Halman","raw_affiliation_strings":["halman@mit.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"halman@mit.edu#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000432625"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.7414,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82100178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"38","issue":"1","first_page":"1","last_page":"45"},"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.9991999864578247,"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.9991999864578247,"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.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7292187213897705},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.5993704199790955},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5680210590362549},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5330145955085754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48063579201698303},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45016273856163025},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4208866357803345},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.41208600997924805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31735169887542725}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7292187213897705},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.5993704199790955},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5680210590362549},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5330145955085754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48063579201698303},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45016273856163025},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4208866357803345},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.41208600997924805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31735169887542725},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060656309","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060656309","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W170832643","https://openalex.org/W1502424759","https://openalex.org/W1533912360","https://openalex.org/W1536187134","https://openalex.org/W1789652828","https://openalex.org/W1963547452","https://openalex.org/W1987752344","https://openalex.org/W1988106539","https://openalex.org/W1997964544","https://openalex.org/W1998932824","https://openalex.org/W2019075172","https://openalex.org/W2022121413","https://openalex.org/W2030923287","https://openalex.org/W2059985428","https://openalex.org/W2066037950","https://openalex.org/W2068290327","https://openalex.org/W2068769655","https://openalex.org/W2068939362","https://openalex.org/W2073141869","https://openalex.org/W2081078973","https://openalex.org/W2108922196","https://openalex.org/W2114657710","https://openalex.org/W2143268232","https://openalex.org/W2148380071","https://openalex.org/W2152479402","https://openalex.org/W2153225323","https://openalex.org/W2167816765","https://openalex.org/W3150133211","https://openalex.org/W4235295814"],"related_works":["https://openalex.org/W1985455246","https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W2476923378","https://openalex.org/W2803221307","https://openalex.org/W2951826204","https://openalex.org/W4211001408","https://openalex.org/W2177546144","https://openalex.org/W2089608799","https://openalex.org/W2107423006"],"abstract_inverted_index":{"Helly's":[0],"theorem":[1],"says":[2],"that,":[3],"if":[4],"every":[5],"$d+1$":[6],"elements":[7],"of":[8,13,29,158,168,175,178,186],"a":[9,19,24,46,63,160,164,172,180,184],"given":[10,48,64],"finite":[11],"set":[12,167,185],"convex":[14,170],"objects":[15,31],"in":[16,32,97,111,114,123,127,146,217,223],"$\\mathbb{R}^d$":[17,147],"have":[18],"common":[20,26,40,55],"point,":[21],"there":[22],"is":[23],"point":[25,41,56],"to":[27,44,125,215],"all":[28],"the":[30,33,39,54,85,115,134,138,141,154,176,191,201,228],"set.":[34,49],"In":[35,50],"discrete":[36,67,135,142,173],"Helly":[37,52,70],"theorems":[38,53,71],"should":[42,57],"belong":[43],"an":[45],"priori":[47],"lexicographic":[51,69,193],"not":[58],"be":[59],"lexicographically":[60],"greater":[61],"than":[62],"point.":[65],"Using":[66],"and":[68,91,190],"we":[72,83,119,211],"get":[73],"linear":[74,88,99,129,204],"time":[75,100,112,130,205,220],"solutions":[76],"for":[77,163,183,197,207,232],"various":[78,221],"optimization":[79],"problems.":[80,103,209,234],"For":[81,104],"this,":[82],"introduce":[84],"DLP-type":[86,102,106],"(discrete":[87],"programming\u2013type)":[89],"model,":[90],"provide":[92],"new":[93],"algorithms":[94,109,206,214,231],"that":[95],"solve":[96,126,216],"randomized":[98,128,218],"fixed-dimensional":[101],"variable-dimensional":[105],"problems,":[107],"our":[108,121,213],"run":[110],"subexponential":[113,219],"combinatorial":[116],"dimension.":[117],"Finally,":[118],"use":[120,212],"results":[122],"order":[124],"problems":[131,222],"such":[132],"as":[133],"p-center":[136,195],"on":[137],"real":[139],"line,":[140],"weighted":[143],"1-center":[144],"problem":[145,157,177,196],"with":[148],"either":[149],"$l_1$":[150],"or":[151],"$l_\\infty$":[152],"norm,":[153],"standard":[155],"(continuous)":[156],"finding":[159,179],"line":[161,181],"transversal":[162,182],"totally":[165],"separable":[166],"planar":[169,188],"objects,":[171],"version":[174],"axis-parallel":[187],"rectangles,":[189],"(planar)":[192],"rectilinear":[194],"$p=1,2,3$.":[198],"These":[199],"are":[200],"first":[202],"known":[203,230],"these":[208,233],"Moreover,":[210],"game":[224],"theory,":[225],"improving":[226],"upon":[227],"best":[229]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}