{"id":"https://openalex.org/W3081784037","doi":"https://doi.org/10.4230/lipics.esa.2020.9","title":"Improved Bounds for Metric Capacitated Covering Problems","display_name":"Improved Bounds for Metric Capacitated Covering Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3081784037","doi":"https://doi.org/10.4230/lipics.esa.2020.9","mag":"3081784037"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001388244","display_name":"Sayan Bandyapadhyay","orcid":"https://orcid.org/0000-0001-8875-0102"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Bandyapadhyay, Sayan","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway","University of Bergen, Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0001-8875-0102","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001388244"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13863901,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9739999771118164,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9739999771118164,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12546","display_name":"Smart Parking Systems Research","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.940500020980835,"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/ball","display_name":"Ball (mathematics)","score":0.7838447093963623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7478123903274536},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7210687398910522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6415171027183533},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.6067250967025757},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6018998026847839},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48291704058647156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3259260654449463},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18846207857131958},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1753479540348053}],"concepts":[{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.7838447093963623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7478123903274536},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7210687398910522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6415171027183533},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.6067250967025757},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6018998026847839},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48291704058647156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3259260654449463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18846207857131958},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1753479540348053},{"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":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:12875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2020.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2020.9","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3035986120","https://openalex.org/W2963591265","https://openalex.org/W2965779392","https://openalex.org/W2577136449","https://openalex.org/W2088168571","https://openalex.org/W2058821164","https://openalex.org/W620970122","https://openalex.org/W2022490362","https://openalex.org/W2060363698","https://openalex.org/W2890196309","https://openalex.org/W3184813271","https://openalex.org/W2604768696","https://openalex.org/W1724901969","https://openalex.org/W2165142526","https://openalex.org/W1551888529","https://openalex.org/W2794817095","https://openalex.org/W2123734400","https://openalex.org/W3113992694","https://openalex.org/W2587951668","https://openalex.org/W2139298384"],"abstract_inverted_index":{"In":[0,153],"the":[1,26,42,47,83,105,122,129,141,144,149,173,193],"Metric":[2],"Capacitated":[3],"Covering":[4],"(MCC)":[5],"problem,":[6],"given":[7],"a":[8,14,22,31,58,79,92,178,185],"set":[9],"of":[10,41,94,104,128,172,182,189],"balls":[11,48],"\u212c":[12,37],"in":[13,44,49],"metric":[15,19],"space":[16],"P":[17,45],"with":[18,68,98,124,167],"d":[20],"and":[21,38,63,148],"capacity":[23],"parameter":[24],"U,":[25],"goal":[27],"is":[28,55,66,87,138,161],"to":[29,46,57,89,139,163],"find":[30],"minimum":[32],"sized":[33],"subset":[34],"\u212c'":[35,50],"\u2286":[36],"an":[39,75,119,165],"assignment":[40],"points":[43],"such":[51],"that":[52,60,115,159],"each":[53,64],"point":[54],"assigned":[56,67],"ball":[59,65],"contains":[61],"it":[62,86,160],"at":[69],"most":[70],"U":[71],"points.":[72],"MCC":[73,190],"achieves":[74],"O(log":[76],"|P|)-approximation":[77],"using":[78],"greedy":[80],"algorithm.":[81],"On":[82],"other":[84],"hand,":[85],"hard":[88],"approximate":[90],"within":[91],"factor":[93,102,126,170],"o(log":[95],"|P|)":[96],"even":[97],"\u03b2":[99],"<":[100],"3":[101,147],"expansion":[103,127,171],"balls.":[106,130,174],"Bandyapadhyay":[107],"et":[108],"al.":[109],"[SoCG":[110],"2018,":[111],"DCG":[112],"2019]":[113],"showed":[114],"one":[116],"can":[117],"obtain":[118,164],"O(1)-approximation":[120,166],"for":[121,184,191],"problem":[123],"6.47":[125],"An":[131],"open":[132],"question":[133],"left":[134],"by":[135],"their":[136],"work":[137],"reduce":[140],"gap":[142],"between":[143],"lower":[145],"bound":[146,151,181,197],"upper":[150,180],"6.47.":[152],"this":[154],"current":[155],"work,":[156],"we":[157],"show":[158,177],"possible":[162],"only":[168],"4.24":[169],"We":[175],"also":[176],"similar":[179],"5":[183],"more":[186],"generalized":[187],"version":[188],"which":[192],"best":[194],"previously":[195],"known":[196],"was":[198],"9.":[199]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}