{"id":"https://openalex.org/W2787947809","doi":"https://doi.org/10.1007/s00453-017-0294-4","title":"An Improved Approximation Algorithm for Knapsack Median Using Sparsification","display_name":"An Improved Approximation Algorithm for Knapsack Median Using Sparsification","publication_year":2018,"publication_date":"2018-01-29","ids":{"openalex":"https://openalex.org/W2787947809","doi":"https://doi.org/10.1007/s00453-017-0294-4","mag":"2787947809"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0294-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0294-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0294-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0294-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023591555","display_name":"Jaros\u0142aw Byrka","orcid":"https://orcid.org/0000-0002-3387-0913"},"institutions":[{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jaros\u0142aw Byrka","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067838875","display_name":"Thomas Pensyl","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":false,"raw_author_name":"Thomas Pensyl","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000959887","display_name":"Bartosz Rybicki","orcid":null},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bartosz Rybicki","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052812610","display_name":"Joachim Spoerhase","orcid":"https://orcid.org/0000-0002-2601-6452"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Joachim Spoerhase","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"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":"Aravind Srinivasan","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028451175","display_name":"Khoa Trinh","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":false,"raw_author_name":"Khoa Trinh","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5005118312"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.6612,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77092349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"80","issue":"4","first_page":"1093","last_page":"1114"},"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.9998999834060669,"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.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9872000217437744,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9861000180244446,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9651243686676025},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6809536218643188},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6741564869880676},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6662497520446777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6301192045211792},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6155165433883667},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5733488202095032},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5454344153404236},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5423049330711365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4989607334136963},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4706425070762634},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.45023995637893677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4048166871070862},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36353808641433716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2855100631713867},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08190953731536865}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9651243686676025},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6809536218643188},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6741564869880676},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6662497520446777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6301192045211792},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6155165433883667},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5733488202095032},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5454344153404236},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5423049330711365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4989607334136963},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4706425070762634},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.45023995637893677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4048166871070862},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36353808641433716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2855100631713867},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08190953731536865},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-017-0294-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0294-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0294-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-017-0294-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0294-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0294-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G1749484715","display_name":"AF: Small: Randomized Algorithms and Stochastic Models","funder_award_id":"1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2833011318","display_name":null,"funder_award_id":"DEC- 2012/07/B/ST6/01534","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G3541380492","display_name":null,"funder_award_id":"CNS 1010789 and CCF 1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5663050348","display_name":null,"funder_award_id":"CNS 1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8911331200","display_name":null,"funder_award_id":"1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2787947809.pdf","grobid_xml":"https://content.openalex.org/works/W2787947809.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W169553655","https://openalex.org/W2023770210","https://openalex.org/W2052494364","https://openalex.org/W2139841919","https://openalex.org/W2165420145","https://openalex.org/W2951012259","https://openalex.org/W2988480584","https://openalex.org/W4205585032","https://openalex.org/W4237565733","https://openalex.org/W4247224216"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1601835603","https://openalex.org/W1984121220","https://openalex.org/W2760293708"],"abstract_inverted_index":{"Knapsack":[0],"median":[1],"is":[2,22],"a":[3,18,45,74],"generalization":[4],"of":[5,69],"the":[6,14,31,52],"classic":[7],"k-median":[8],"problem":[9,57],"in":[10,35],"which":[11],"we":[12],"replace":[13],"cardinality":[15],"constraint":[16],"with":[17,58,77],"knapsack":[19],"constraint.":[20],"It":[21],"currently":[23],"known":[24,33],"to":[25],"be":[26],"32-approximable.":[27],"We":[28,71],"improve":[29],"on":[30],"best":[32],"algorithms":[34],"several":[36],"ways,":[37],"including":[38],"adding":[39],"randomization":[40],"and":[41],"applying":[42],"sparsification":[43],"as":[44],"preprocessing":[46],"step.":[47],"The":[48,62],"latter":[49],"improvement":[50],"produces":[51],"first":[53],"LP":[54],"for":[55],"this":[56],"bounded":[59],"integrality":[60],"gap.":[61],"new":[63],"algorithm":[64],"obtains":[65],"an":[66],"approximation":[67,76],"factor":[68],"17.46.":[70],"also":[72],"give":[73],"3.05":[75],"small":[78],"budget":[79],"violation.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}