{"id":"https://openalex.org/W1524471135","doi":"https://doi.org/10.1145/2963170","title":"Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications","display_name":"Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications","publication_year":2016,"publication_date":"2016-08-03","ids":{"openalex":"https://openalex.org/W1524471135","doi":"https://doi.org/10.1145/2963170","mag":"1524471135"},"language":"en","primary_location":{"id":"doi:10.1145/2963170","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2963170","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5031968426","display_name":"Chaitanya Swamy","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Chaitanya Swamy","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031968426"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":3.1462,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.91914141,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"22"},"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.9998000264167786,"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.9998000264167786,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9898999929428101,"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/T12288","display_name":"Optimization and Search Problems","score":0.9815999865531921,"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/matroid","display_name":"Matroid","score":0.969230055809021},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8883318901062012},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6943113207817078},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.6936895847320557},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6901754140853882},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.6492891907691956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5536770820617676},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.5271472930908203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47913262248039246},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4509319067001343},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44793593883514404},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.44266873598098755},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43274545669555664},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.422130286693573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3955153524875641},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3742002844810486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3513784408569336},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.2333342432975769}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.969230055809021},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8883318901062012},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6943113207817078},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.6936895847320557},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6901754140853882},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.6492891907691956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5536770820617676},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.5271472930908203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47913262248039246},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4509319067001343},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44793593883514404},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.44266873598098755},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43274545669555664},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.422130286693573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3955153524875641},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3742002844810486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3513784408569336},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.2333342432975769},{"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/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.1145/2963170","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2963170","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G3547378653","display_name":null,"funder_award_id":"327620-09","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W169553655","https://openalex.org/W1509863433","https://openalex.org/W1714443387","https://openalex.org/W1967391655","https://openalex.org/W1978117135","https://openalex.org/W1989289072","https://openalex.org/W2018682510","https://openalex.org/W2022708950","https://openalex.org/W2076746184","https://openalex.org/W2085751730","https://openalex.org/W2125938788","https://openalex.org/W2340149117","https://openalex.org/W2395976569","https://openalex.org/W2484325476","https://openalex.org/W2512208967","https://openalex.org/W2949533399","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W2378157773","https://openalex.org/W2159059797","https://openalex.org/W2153065381","https://openalex.org/W2980228156","https://openalex.org/W4303709689","https://openalex.org/W2950665492","https://openalex.org/W2625145881","https://openalex.org/W2408531236"],"abstract_inverted_index":{"We":[0,62,84,139],"consider":[1],"the":[2,25,54,57,77,86,99,131,151,171,195],"matroid":[3,23,106,120,172],"median":[4,101,107,121,173,176,197],"problem":[5,70],"[Krishnaswamy":[6],"et":[7,81,136],"al.":[8,82,137],"2011],":[9],"wherein":[10],"we":[11,35,109],"are":[12],"given":[13],"a":[14,22,64,103,116,127,142],"set":[15,41],"of":[16,42,56,90,105,144],"facilities":[17,43,49],"with":[18,29,122],"opening":[19],"costs":[20],"and":[21,27,31,34,44,59,88,114,178],"on":[24,72],"facility-set,":[26],"clients":[28,46],"demands":[30],"connection":[32],"costs,":[33],"seek":[36],"to":[37,47,52,170],"open":[38,48],"an":[39,96,192],"independent":[40],"assign":[45],"so":[50],"as":[51],"minimize":[53],"sum":[55],"facility-opening":[58],"client-connection":[60],"costs.":[61],"give":[63],"simple":[65],"8-approximation":[66,97],"algorithm":[67,118],"for":[68,98,119,184,194],"this":[69],"based":[71],"LP-rounding,":[73],"which":[74,125],"improves":[75],"upon":[76],"16-approximation":[78],"in":[79,134,150],"Krishnaswamy":[80,135],"[2011].":[83,138],"illustrate":[85],"power":[87],"versatility":[89],"our":[91],"techniques":[92,189],"by":[93],"deriving":[94],"(a)":[95],"two-matroid":[100,175],"problem,":[102,154],"generalization":[104],"that":[108,141],"introduce":[110],"involving":[111],"two":[112],"matroids;":[113],"(b)":[115],"24-approximation":[117],"penalties":[123],",":[124],"is":[126],"vast":[128],"improvement":[129,193],"over":[130],"360-approximation":[132],"obtained":[133],"show":[140],"variety":[143],"seemingly":[145],"disparate":[146],"facility-location":[147],"problems":[148],"considered":[149],"literature\u2014data":[152],"placement":[153],"mobile":[155],"facility":[156],"location,":[157],"k":[158],"-median":[159],"forest,":[160],"metric":[161],"uniform":[162],"minimum-latency":[163],"Uncapacitated":[164],"Facility":[165],"Location":[166],"(UFL)\u2014in":[167],"fact":[168],"reduce":[169],"or":[174],"problems,":[177],"thus":[179],"obtain":[180],"improved":[181],"approximation":[182],"guarantees":[183],"all":[185],"these":[186],"problems.":[187],"Our":[188],"also":[190],"yield":[191],"knapsack":[196],"problem.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}