{"id":"https://openalex.org/W2132274124","doi":"https://doi.org/10.1007/s00453-004-1113-2","title":"The Power of Priority Algorithms for Facility Location and Set Cover","display_name":"The Power of Priority Algorithms for Facility Location and Set Cover","publication_year":2004,"publication_date":"2004-08-18","ids":{"openalex":"https://openalex.org/W2132274124","doi":"https://doi.org/10.1007/s00453-004-1113-2","mag":"2132274124"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1113-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1113-2","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/A5107303715","display_name":"Spyros Angelopoulos","orcid":"https://orcid.org/0000-0001-9819-9158"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Spyros Angelopoulos","raw_affiliation_strings":["Department of Computer \nScience, University of Toronto, \nToronto, Ontario, M5S 3G4, Canada","Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer \nScience, University of Toronto, \nToronto, Ontario, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109583026","display_name":"Allan Borodin","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Allan Borodin","raw_affiliation_strings":["Department of Computer \nScience, University of Toronto, \nToronto, Ontario, M5S 3G4, Canada","Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer \nScience, University of Toronto, \nToronto, Ontario, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.4612,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.92563052,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"40","issue":"4","first_page":"271","last_page":"291"},"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.9998000264167786,"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.9998000264167786,"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.9980000257492065,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/set-cover-problem","display_name":"Set cover problem","score":0.797775387763977},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7903586030006409},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7134163975715637},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6688160300254822},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6551737785339355},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6203501224517822},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5957493782043457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5884383916854858},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5652111172676086},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.542605996131897},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.5106306672096252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4894494116306305},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45273345708847046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44952619075775146},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4492335915565491},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4431106448173523},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43080201745033264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3863459825515747},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23020514845848083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09737592935562134}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.797775387763977},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7903586030006409},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7134163975715637},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6688160300254822},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6551737785339355},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6203501224517822},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5957493782043457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5884383916854858},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5652111172676086},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.542605996131897},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.5106306672096252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4894494116306305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45273345708847046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44952619075775146},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4492335915565491},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4431106448173523},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43080201745033264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3863459825515747},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23020514845848083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09737592935562134},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-004-1113-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1113-2","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.4334","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~bor/facility.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.7395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.7395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~sangelop/Papers/fl-algorithmica.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.9459","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.9459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~bor/Papers/priority-facility1.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-02986755v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02986755","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2004, 40, pp.271-291. ⟨10.1007/s00453-004-1113-2⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1601812897","https://openalex.org/W1696776098","https://openalex.org/W1969665089","https://openalex.org/W1971801736","https://openalex.org/W2006514056","https://openalex.org/W2036153837","https://openalex.org/W2040924621","https://openalex.org/W2046554800","https://openalex.org/W2076746184","https://openalex.org/W2100369465","https://openalex.org/W2101622070","https://openalex.org/W2122381782","https://openalex.org/W2139841919","https://openalex.org/W2143996311","https://openalex.org/W2146823188","https://openalex.org/W2147670675","https://openalex.org/W2151242668","https://openalex.org/W2157054705","https://openalex.org/W2159579504","https://openalex.org/W2163322487","https://openalex.org/W2177789740","https://openalex.org/W3136693265"],"related_works":["https://openalex.org/W2113943781","https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W2044818254","https://openalex.org/W2075346653","https://openalex.org/W4247100793","https://openalex.org/W1966805076","https://openalex.org/W2077783414","https://openalex.org/W1498886170","https://openalex.org/W3120026953"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}