{"id":"https://openalex.org/W4391272150","doi":"https://doi.org/10.48550/arxiv.2401.13819","title":"Separating $k$-Median from the Supplier Version","display_name":"Separating $k$-Median from the Supplier Version","publication_year":2024,"publication_date":"2024-01-24","ids":{"openalex":"https://openalex.org/W4391272150","doi":"https://doi.org/10.48550/arxiv.2401.13819"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2401.13819","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2401.13819","pdf_url":"https://arxiv.org/pdf/2401.13819","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2401.13819","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027182434","display_name":"Aditya Anand","orcid":"https://orcid.org/0009-0008-8816-0266"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anand, Aditya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102609887","display_name":"Euiwoong Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Euiwoong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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.9952999949455261,"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.9952999949455261,"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.9764000177383423,"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.9395999908447266,"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/combinatorics","display_name":"Combinatorics","score":0.7963718175888062},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7802930474281311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.707705020904541},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6421476602554321},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5597326159477234},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5528754591941833},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5219866037368774},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5190044641494751},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4944472312927246},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4646088182926178},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4572427570819855},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4529487192630768},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42797377705574036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37033525109291077},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12339168787002563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0832664966583252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08168640732765198}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7963718175888062},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7802930474281311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.707705020904541},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6421476602554321},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5597326159477234},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5528754591941833},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5219866037368774},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5190044641494751},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4944472312927246},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4646088182926178},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4572427570819855},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4529487192630768},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42797377705574036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37033525109291077},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12339168787002563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0832664966583252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08168640732765198},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2401.13819","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2401.13819","pdf_url":"https://arxiv.org/pdf/2401.13819","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2401.13819","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2401.13819","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2401.13819","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2401.13819","pdf_url":"https://arxiv.org/pdf/2401.13819","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391272150.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2963411648","https://openalex.org/W2115404728"],"abstract_inverted_index":{"Given":[0],"a":[1,102,143,157],"metric":[2],"space":[3],"$(V,":[4],"d)$":[5],"along":[6],"with":[7,61,180],"an":[8,53],"integer":[9],"$k$,":[10],"the":[11,39,47,62,67,85,93,118,123,127,133,137,149,177,181,186,190],"$k$-Median":[12,135],"problem":[13],"asks":[14],"to":[15,22,116],"open":[16],"$k$":[17],"centers":[18],"$C":[19,64],"\\subseteq":[20,57,65],"V$":[21,58],"minimize":[23],"$\\sum_{v":[24],"\\in":[25,34],"V}":[26],"d(v,":[27,36],"C)$,":[28],"where":[29,52],"$d(v,":[30],"C)":[31],":=":[32],"\\min_{c":[33],"C}":[35],"c)$.":[37],"While":[38],"best-known":[40],"approximation":[41,104,120],"ratio":[42,121],"of":[43,161,192],"$2.613$":[44],"holds":[45],"for":[46,71,122,145,163],"more":[48],"general":[49],"supplier":[50,124,138],"version":[51,125],"additional":[54],"set":[55,165],"$F":[56],"is":[59,114,154],"given":[60],"restriction":[63],"F$,":[66],"best":[68],"known":[69],"hardness":[70,160],"these":[72],"two":[73,95],"versions":[74],"are":[75,173],"$1+1/e":[76],"\\approx":[77,81],"1.36$":[78],"and":[79,170,194],"$1+2/e":[80],"1.73$":[82],"respectively,":[83],"using":[84],"same":[86,178],"reduction":[87],"from":[88,136,175,185],"Max":[89],"$k$-Coverage.":[90],"We":[91],"prove":[92,142],"following":[94],"results":[96],"separating":[97],"them.":[98],"First,":[99],"we":[100,141],"show":[101],"$1.546$-parameterized":[103],"algorithm":[105],"that":[106],"runs":[107],"in":[108,126],"time":[109],"$f(k)":[110],"n^{O(1)}$.":[111],"Since":[112],"$1+2/e$":[113],"proved":[115],"be":[117],"optimal":[119],"parameterized":[128],"setting,":[129],"this":[130],"result":[131],"separates":[132],"original":[134],"version.":[139],"Next,":[140],"$1.416$-hardness":[144],"polynomial-time":[146],"algorithms":[147],"assuming":[148],"Unique":[150],"Games":[151],"Conjecture.":[152],"This":[153],"achieved":[155],"via":[156],"new":[158],"fine-grained":[159],"Max-$k$-Coverage":[162],"small":[164],"sizes.":[166],"Our":[167],"upper":[168],"bound":[169,172],"lower":[171],"derived":[174],"almost":[176],"expression,":[179],"only":[182],"difference":[183],"coming":[184],"well-known":[187],"separation":[188],"between":[189],"powers":[191],"LP":[193],"SDP":[195],"on":[196],"(hypergraph)":[197],"vertex":[198],"cover.":[199]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}