{"id":"https://openalex.org/W4413181694","doi":"https://doi.org/10.1007/s00453-025-01338-4","title":"On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP","display_name":"On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP","publication_year":2025,"publication_date":"2025-08-13","ids":{"openalex":"https://openalex.org/W4413181694","doi":"https://doi.org/10.1007/s00453-025-01338-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01338-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-025-01338-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5066903534","display_name":"C. S. Karthik","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Karthik C.S.","raw_affiliation_strings":["Rutgers University, New Brunswick, USA"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001520779","display_name":"Pasin Manurangsi","orcid":"https://orcid.org/0000-0002-1052-2801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pasin Manurangsi","raw_affiliation_strings":["Google Research, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Google Research, Bangkok, Thailand","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066903534"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22561901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"12","first_page":"1711","last_page":"1731"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9984999895095825,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8723671436309814},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6642319560050964},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6505587697029114},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6262116432189941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5833892822265625},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.5142461657524109},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4354018568992615},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4237910211086273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38114219903945923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34448176622390747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29301416873931885},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2405206859111786}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8723671436309814},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6642319560050964},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6505587697029114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6262116432189941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5833892822265625},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.5142461657524109},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4354018568992615},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4237910211086273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38114219903945923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34448176622390747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29301416873931885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2405206859111786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-025-01338-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-025-01338-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2085515873","display_name":null,"funder_award_id":"2313372","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G3445849262","display_name":null,"funder_award_id":"2236669","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8260862973","display_name":null,"funder_award_id":"825876","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"}],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1985572324","https://openalex.org/W1990313671","https://openalex.org/W1995725694","https://openalex.org/W2019578639","https://openalex.org/W2036930319","https://openalex.org/W2038691311","https://openalex.org/W2086653003","https://openalex.org/W2116087731","https://openalex.org/W2120358419","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2625656873","https://openalex.org/W2787022562","https://openalex.org/W2893188841","https://openalex.org/W2914414140","https://openalex.org/W2942833401","https://openalex.org/W2944399784","https://openalex.org/W2962951564","https://openalex.org/W2968783941","https://openalex.org/W2977536198","https://openalex.org/W3001868306","https://openalex.org/W3002240277","https://openalex.org/W3022115507","https://openalex.org/W3036033298","https://openalex.org/W3036402366","https://openalex.org/W3044099633","https://openalex.org/W3148295545","https://openalex.org/W3155138594","https://openalex.org/W3167294045","https://openalex.org/W3213983356","https://openalex.org/W4236385439","https://openalex.org/W4243637616","https://openalex.org/W4316652377","https://openalex.org/W4316652465","https://openalex.org/W4376639559","https://openalex.org/W4390098188","https://openalex.org/W4411319981","https://openalex.org/W4412653018"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-10-10T00:00:00"}