{"id":"https://openalex.org/W2278683589","doi":null,"title":"Approximation algorithms for facility location problems","display_name":"Approximation algorithms for facility location problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2278683589","mag":"2278683589"},"language":"en","primary_location":{"id":"mag:2278683589","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=929670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5085685321","display_name":"Yoram J. Sussmann","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoram J. Sussmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023","observed_orcids":["https://orcid.org/0000-0002-5408-8023"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-5408-8023","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9398999810218811,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9398999810218811,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.027000000700354576,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.01549999974668026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.9309999942779541},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/k-center-problem","display_name":"k-center problem","score":0.7979999780654907},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.6880000233650208},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.7789999842643738},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.7609999775886536},{"id":"https://openalex.org/keywords/facility-placement","display_name":"facility placement","score":0.5360000133514404},{"id":"https://openalex.org/keywords/emergency-facility-location","display_name":"emergency facility location","score":0.5490000247955322}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.875484049320221},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8382440805435181},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5958154797554016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931474566459656},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.5522862076759338},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5409864187240601},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45345446467399597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43768078088760376},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.41814666986465454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25211745500564575},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2278683589","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=929670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2979477539","https://openalex.org/W2608158342","https://openalex.org/W2917390388","https://openalex.org/W2667164537","https://openalex.org/W7097409136","https://openalex.org/W2128671402","https://openalex.org/W2101622070","https://openalex.org/W2908903732","https://openalex.org/W2968332808","https://openalex.org/W1911336049"],"abstract_inverted_index":{"Facility":[0],"location":[1,74,93,120,145],"problems":[2,42,75,146],"arise":[3],"in":[4,193,199],"such":[5],"areas":[6],"as":[7,31,122,124],"the":[8,20,77,98,114,126,134,143,158,178,213,218],"selection":[9],"of":[10,22,40,79,100,142,157,165,177,215],"locations":[11],"for":[12,90,113,125,217],"servers":[13],"or":[14,19],"databases":[15],"on":[16,97,111],"a":[17,117,153],"network,":[18],"placement":[21],"emergency":[23],"facilities":[24,29],"(e.g.":[25],"fire":[26],"stations),":[27],"hazardous":[28],"(such":[30],"waste":[32],"sites),":[33],"post":[34],"offices,":[35],"bus":[36],"stops,":[37],"etc.":[38],"Most":[39],"these":[41],"are":[43,88,104,109,149,205],"NP-hard,":[44],"and":[45,65,95,211],"have":[46],"no":[47],"known":[48],"polynomial-time":[49],"algorithms":[50,61,87,216],"that":[51,62,140,184,189,207],"solve":[52,84],"them":[53],"optimally.":[54],"It":[55],"is":[56,130,138],"therefore":[57],"natural":[58],"to":[59,83,133,151,172],"seek":[60],"run":[63],"quickly":[64],"produce":[66],"good":[67,81],"suboptimal":[68],"solutions.":[69],"\r\nThis":[70],"dissertation":[71],"studies":[72],"facility":[73,92,119,144],"with":[76],"goal":[78],"finding":[80],"heuristics":[82,112,185],"them.":[85],"Approximation":[86],"formulated":[89],"several":[91,203],"problems,":[94],"guarantees":[96],"quality":[99],"solutions":[101,192],"they":[102],"return":[103,190],"derived.":[105],"In":[106,201],"addition,":[107],"experiments":[108,182],"conducted":[110],"K-center":[115,135],"problem,":[116,121,128],"fundamental":[118],"well":[123],"K-cluster":[127],"which":[129],"closely":[131],"related":[132],"problem.":[136,221],"\r\nIt":[137],"shown":[139],"many":[141],"studied":[147,167],"here":[148,168],"approximable":[150],"within":[152,173],"small":[154],"constant":[155,175],"factor":[156,176],"optimal":[159,179],"solution.":[160,180],"All":[161],"but":[162],"one":[163],"class":[164],"problem":[166],"can":[169,186,196],"be":[170,187,197],"approximated":[171],"some":[174],"The":[181],"demonstrate":[183],"devised":[188],"better":[191],"practice":[194],"than":[195],"proven":[198],"theory.":[200],"addition":[202],"improvements":[204],"proposed":[206],"both":[208],"speed":[209],"up":[210],"improve":[212],"performance":[214],"K":[219],"-center":[220]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}