{"id":"https://openalex.org/W2577136449","doi":"https://doi.org/10.4230/lipics.fsttcs.2016.8","title":"Capacitated k-Center Problem with Vertex Weights","display_name":"Capacitated k-Center Problem with Vertex Weights","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2577136449","doi":"https://doi.org/10.4230/lipics.fsttcs.2016.8","mag":"2577136449"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6843","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045546662","display_name":"Aounon Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kumar, Aounon","raw_affiliation_strings":["University of Maryland, College Park, College Park, United States"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, College Park, United States","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045546662"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.4495,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78513219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"14","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7428085207939148},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7090374231338501},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6869997382164001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6544447541236877},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6107053756713867},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5584709048271179},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5457767844200134},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.46771708130836487},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.46352702379226685},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.41042810678482056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4101475179195404},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23984336853027344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11128571629524231},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08738917112350464}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7428085207939148},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7090374231338501},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6869997382164001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6544447541236877},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6107053756713867},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5584709048271179},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5457767844200134},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46771708130836487},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.46352702379226685},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.41042810678482056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4101475179195404},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23984336853027344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11128571629524231},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08738917112350464},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:6843","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fsttcs.2016.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2016.8","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2577136449","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2016.html#Kumar16","pdf_url":null,"source":{"id":"https://openalex.org/S4306418453","display_name":"Foundations of Software Technology and Theoretical Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Foundations of Software Technology and Theoretical Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6843","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1504294538","https://openalex.org/W1956536100","https://openalex.org/W154567010","https://openalex.org/W2139298384","https://openalex.org/W2949438963","https://openalex.org/W1541636944","https://openalex.org/W3184813271","https://openalex.org/W2139785710","https://openalex.org/W2075346653","https://openalex.org/W2123734400","https://openalex.org/W2072015757","https://openalex.org/W1964932748","https://openalex.org/W2242006561","https://openalex.org/W1506627918","https://openalex.org/W2293564405","https://openalex.org/W2148092222","https://openalex.org/W2770160826","https://openalex.org/W2070814595","https://openalex.org/W3081784037","https://openalex.org/W2999513600"],"abstract_inverted_index":{"We":[0,75,185,197,211],"study":[1],"the":[2,14,42,45,48,54,91,96,99,102,106,118,123,140,146,169,173,176,182,199,221],"capacitated":[3,100],"k-center":[4,17,107],"problem":[5,108,150,170],"with":[6,151],"vertex":[7,23,35,49],"weights.":[8],"It":[9],"is":[10,39,90,145],"a":[11,25,28,34,37,62,114,130,157,204,214],"generalization":[12],"of":[13,33,44,47,93,105,121,142,168,175,223],"well":[15],"known":[16,154],"problem.":[18,210],"In":[19],"this":[20,81,193,209],"variant":[21],"each":[22],"has":[24],"weight":[26,46],"and":[27,50,101],"capacity.":[29,74],"The":[30,56,161],"assignment":[31,177],"cost":[32],"to":[36,53,60,139,155,166],"center":[38,65],"given":[40],"by":[41,202],"product":[43],"its":[51,73],"distance":[52],"center.":[55],"distances":[57,153],"are":[58],"assumed":[59],"form":[61],"metric.":[63],"Each":[64],"can":[66,110],"only":[67],"serve":[68],"as":[69,72,181],"many":[70],"vertices":[71,94],"show":[76],"an":[77],"n^{1-epsilon}-approximation":[78],"hardness":[79,162,191,200],"for":[80,83,192,195,208,220],"problem,":[82,138,194],"any":[84],"epsilon":[85],">":[86],"0,":[87],"where":[88],"n":[89],"number":[92],"in":[95],"input.":[97],"Both":[98],"weighted":[103],"versions":[104,167],"individually":[109],"be":[111,126],"approximated":[112,127],"within":[113,129],"constant":[115,131,216],"factor.":[116],"Yet":[117],"common":[119],"extension":[120],"both":[122],"generalizations":[124],"cannot":[125],"efficiently":[128],"factor,":[132],"unless":[133],"P":[134],"=":[135],"NP.":[136],"This":[137],"best":[141],"our":[143],"knowledge,":[144],"first":[147],"facility":[148],"location":[149],"metric":[152],"have":[156],"super-constant":[158],"inapproximability":[159],"result.":[160],"result":[163,201],"easily":[164],"generalizes":[165],"that":[171],"consider":[172],"p-norm":[174],"costs":[178],"(weighted":[179],"distances)":[180],"objective":[183],"function.":[184],"give":[186,213],"n^{1-":[187],"1/p":[188],"-":[189],"epsilon}-approximation":[190],"p>1.":[196],"complement":[198],"showing":[203],"simple":[205],"n-approximation":[206],"algorithm":[207],"also":[212],"bi-criteria":[215],"factor":[217],"approximation":[218],"algorithm,":[219],"case":[222],"uniform":[224],"capacities,":[225],"which":[226],"opens":[227],"at":[228],"most":[229],"2k":[230],"centers.":[231]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}