{"id":"https://openalex.org/W114839846","doi":"https://doi.org/10.1007/bf01580426","title":"An efficient algorithm for minimumk-covers in weighted graphs","display_name":"An efficient algorithm for minimumk-covers in weighted graphs","publication_year":1975,"publication_date":"1975-12-01","ids":{"openalex":"https://openalex.org/W114839846","doi":"https://doi.org/10.1007/bf01580426","mag":"114839846"},"language":"en","primary_location":{"id":"doi:10.1007/bf01580426","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580426","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5026288605","display_name":"Lee White","orcid":"https://orcid.org/0000-0002-4595-5981"},"institutions":[{"id":"https://openalex.org/I199172307","display_name":"Columbus State University","ror":"https://ror.org/002nf6z37","country_code":"US","type":"education","lineage":["https://openalex.org/I199172307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lee J. White","raw_affiliation_strings":["The Chio State University, Columbus, Chio, USA","The Chio State University, Columbus, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chio State University, Columbus, Chio, USA","institution_ids":[]},{"raw_affiliation_string":"The Chio State University, Columbus, USA","institution_ids":["https://openalex.org/I199172307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029888671","display_name":"Mark L. Gillenson","orcid":null},"institutions":[{"id":"https://openalex.org/I199172307","display_name":"Columbus State University","ror":"https://ror.org/002nf6z37","country_code":"US","type":"education","lineage":["https://openalex.org/I199172307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark L. Gillenson","raw_affiliation_strings":["The Chio State University, Columbus, Chio, USA","The Chio State University, Columbus, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chio State University, Columbus, Chio, USA","institution_ids":[]},{"raw_affiliation_string":"The Chio State University, Columbus, USA","institution_ids":["https://openalex.org/I199172307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I199172307"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":3.7324,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91264368,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"1","first_page":"20","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9958999752998352,"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/mathematics","display_name":"Mathematics","score":0.8084304928779602},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6697942018508911},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6355898380279541},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5912075042724609},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5855312347412109},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5478626489639282},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5453585386276245},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5157876014709473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49201008677482605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39975857734680176},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.31401705741882324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30741018056869507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12003055214881897},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07528877258300781}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8084304928779602},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6697942018508911},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6355898380279541},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5912075042724609},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5855312347412109},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5478626489639282},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5453585386276245},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5157876014709473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49201008677482605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39975857734680176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31401705741882324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30741018056869507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12003055214881897},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07528877258300781},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01580426","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580426","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1843974934","https://openalex.org/W1965680834","https://openalex.org/W1992428442","https://openalex.org/W2020403120","https://openalex.org/W2027421115","https://openalex.org/W2027792479","https://openalex.org/W2044848207","https://openalex.org/W2048652909","https://openalex.org/W2059608229","https://openalex.org/W2069277547","https://openalex.org/W2093062463","https://openalex.org/W2327315803","https://openalex.org/W3034528871","https://openalex.org/W4233756358","https://openalex.org/W4387841709"],"related_works":["https://openalex.org/W2551034790","https://openalex.org/W2029933769","https://openalex.org/W1712180277","https://openalex.org/W2056597184","https://openalex.org/W1502438505","https://openalex.org/W1968988491","https://openalex.org/W2125212169","https://openalex.org/W2538178083","https://openalex.org/W1548167816","https://openalex.org/W4285240128"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}