{"id":"https://openalex.org/W2137185621","doi":"https://doi.org/10.1007/s10878-012-9464-0","title":"Tight approximation bounds for combinatorial frugal coverage algorithms","display_name":"Tight approximation bounds for combinatorial frugal coverage algorithms","publication_year":2012,"publication_date":"2012-02-24","ids":{"openalex":"https://openalex.org/W2137185621","doi":"https://doi.org/10.1007/s10878-012-9464-0","mag":"2137185621"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-012-9464-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-012-9464-0","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5046035189","display_name":"Ioannis Caragiannis","orcid":"https://orcid.org/0000-0002-4918-7131"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Ioannis Caragiannis","raw_affiliation_strings":["Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004643947","display_name":"Christos Kaklamanis","orcid":null},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Kaklamanis","raw_affiliation_strings":["Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047630187","display_name":"Maria Kyropoulou","orcid":"https://orcid.org/0000-0001-6913-8006"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Maria Kyropoulou","raw_affiliation_strings":["Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, 26504, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Engineering and Informatics and CTI, University of Patras, Rio, Greece 26504#TAB#","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046035189"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.6473,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72359637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"26","issue":"2","first_page":"292","last_page":"309"},"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.9987999796867371,"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.9987999796867371,"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.9939000010490417,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7130260467529297},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6697366237640381},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6097325086593628},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5806184411048889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5693812966346741},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5447597503662109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5424014925956726},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5118417143821716},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.47263476252555847},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45952707529067993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37868592143058777},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3254265785217285}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7130260467529297},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6697366237640381},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6097325086593628},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5806184411048889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5693812966346741},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5447597503662109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5424014925956726},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5118417143821716},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.47263476252555847},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45952707529067993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37868592143058777},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3254265785217285},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10878-012-9464-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-012-9464-0","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:26:y:2013:i:2:d:10.1007_s10878-012-9464-0","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-012-9464-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:2ec24808-41c2-4e46-89a1-e0dc13941a07","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:2ec24808-41c2-4e46-89a1-e0dc13941a07","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:b9267fda-ca9d-4408-bae0-927e6e89677d","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b9267fda-ca9d-4408-bae0-927e6e89677d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1496354680","https://openalex.org/W1830560292","https://openalex.org/W1971391161","https://openalex.org/W1980328919","https://openalex.org/W1986177268","https://openalex.org/W1991242013","https://openalex.org/W2003159902","https://openalex.org/W2019216770","https://openalex.org/W2040924621","https://openalex.org/W2052494364","https://openalex.org/W2140118062","https://openalex.org/W2143996311","https://openalex.org/W2949353491","https://openalex.org/W3023887031","https://openalex.org/W6601612977"],"related_works":["https://openalex.org/W2035485837","https://openalex.org/W1550117727","https://openalex.org/W3095810947","https://openalex.org/W2037870595","https://openalex.org/W2202486749","https://openalex.org/W2325870907","https://openalex.org/W2147086810","https://openalex.org/W3165916245","https://openalex.org/W1594413663","https://openalex.org/W2019216770"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}
