{"id":"https://openalex.org/W2171134634","doi":"https://doi.org/10.1145/1383369.1383381","title":"Approximation algorithms for a facility location problem with service capacities","display_name":"Approximation algorithms for a facility location problem with service capacities","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2171134634","doi":"https://doi.org/10.1145/1383369.1383381","mag":"2171134634"},"language":"en","primary_location":{"id":"doi:10.1145/1383369.1383381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383381","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5003575415","display_name":"Jens Ma\u00dfberg","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Ma\u00dfberg","raw_affiliation_strings":["University of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["University of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":2.0153,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87581461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"4","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9991000294685364,"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.9984999895095825,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8820801973342896},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.8271448612213135},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7985405921936035},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5918347239494324},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5675839185714722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5605432987213135},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5308576226234436},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5173101425170898},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.496938019990921},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4899710714817047},{"id":"https://openalex.org/keywords/1-center-problem","display_name":"1-center problem","score":0.48048296570777893},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4382110834121704},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43290138244628906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4109208583831787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2709624469280243}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8820801973342896},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.8271448612213135},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7985405921936035},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5918347239494324},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5675839185714722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5605432987213135},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5308576226234436},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5173101425170898},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.496938019990921},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4899710714817047},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.48048296570777893},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4382110834121704},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43290138244628906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4109208583831787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2709624469280243},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1383369.1383381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383381","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1552851923","https://openalex.org/W1557310162","https://openalex.org/W1601649239","https://openalex.org/W1972755385","https://openalex.org/W1974713906","https://openalex.org/W1989301250","https://openalex.org/W1990327548","https://openalex.org/W2020112047","https://openalex.org/W2052064586","https://openalex.org/W2060380213","https://openalex.org/W2069712919","https://openalex.org/W2104116032","https://openalex.org/W2110367141","https://openalex.org/W2123068254","https://openalex.org/W2155911206","https://openalex.org/W2157338118","https://openalex.org/W2165142526","https://openalex.org/W2401610261","https://openalex.org/W4210431029","https://openalex.org/W4255529553","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3464401","https://openalex.org/W2560968905","https://openalex.org/W2293751504","https://openalex.org/W1928108830","https://openalex.org/W3029224032","https://openalex.org/W1979163442","https://openalex.org/W2963947876","https://openalex.org/W2963809215","https://openalex.org/W1984819898","https://openalex.org/W2171134634"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,8,124,128,144,151],"first":[3],"constant-factor":[4],"approximation":[5],"algorithms":[6],"for":[7,67,93],"following":[9],"problem.":[10,131],"Given":[11],"a":[12,20,37,46,53,164,169,175,181],"metric":[13],"space":[14],"(":[15,70,79,81,87,106,108,186],"V":[16,25],",":[17,36,51,188],"c":[18,78,105,189],"),":[19],"finite":[21],"set":[22],"D":[23,32,55,57,60,68,88,187],"\u2286":[24],"of":[26,147],"terminals/customers":[27],"with":[28,77],"demands":[29],"d":[30,86],":":[31],"\u2192":[33],"R":[34,43],"+":[35,44,50,85,112],"facility":[38,139,156],"opening":[39],"cost":[40,153],"f":[41],"\u2208":[42],"and":[45,62,127,138,174],"capacity":[47],"u":[48,92],"\u2208R":[49],"find":[52],"partition":[54],"=":[56,72,95,102],"1":[58,103],"\u228d\u2026\u228d":[59],"k":[61,75,97,104],"Steiner":[63,129],"trees":[64],"T":[65,82,109],"i":[66,69,71,83,89,94,101,110],"1,":[73],"\u2026,":[74],")":[76,90],"E":[80,107],"))":[84,111],"\u2264":[91],"1,\u2026,":[96],"such":[98],"that":[99,154],"\u03a3":[100],"kf":[113],"is":[114],"minimum.":[115],"This":[116],"problem":[117,126],"arises":[118],"in":[119,166,171],"VLSI":[120],"design.":[121],"It":[122],"generalizes":[123],"bin-packing":[125],"tree":[130,184],"In":[132],"contrast":[133],"to":[134],"other":[135,160],"network":[136],"design":[137],"location":[140],"problems,":[141],"it":[142],"has":[143],"additional":[145],"feature":[146],"upper":[148],"bounds":[149],"on":[150,185],"service":[152],"each":[155],"can":[157],"handle.":[158],"Among":[159],"results,":[161],"we":[162],"obtain":[163],"4.1-approximation":[165],"polynomial":[167],"time,":[168,173],"4.5-approximation":[170],"cubic":[172],"5-approximation":[176],"as":[177,179],"fast":[178],"computing":[180],"minimum":[182],"spanning":[183],").":[190]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}