{"id":"https://openalex.org/W2047424666","doi":"https://doi.org/10.1016/s0166-218x(00)00383-8","title":"A 2-approximation algorithm for the minimum weight edge dominating set problem","display_name":"A 2-approximation algorithm for the minimum weight edge dominating set problem","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2047424666","doi":"https://doi.org/10.1016/s0166-218x(00)00383-8","mag":"2047424666"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(00)00383-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00383-8","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5006109156","display_name":"Toshihiro Fujito","orcid":"https://orcid.org/0000-0001-7892-6426"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshihiro Fujito","raw_affiliation_strings":["Department of Electronics, Nagoya University, Furo, Chikusa, Nagoya 464-8603, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electronics, Nagoya University, Furo, Chikusa, Nagoya 464-8603, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073738140","display_name":"Hiroshi Nagamochi","orcid":"https://orcid.org/0000-0002-8332-1517"},"institutions":[{"id":"https://openalex.org/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi Nagamochi","raw_affiliation_strings":["Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka, Tempaku, Toyohashi 441-8580, Japan","Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka, Tempaku, Toyohashi 441-8580, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka, Tempaku, Toyohashi 441-8580, Japan","institution_ids":["https://openalex.org/I136259955"]},{"raw_affiliation_string":"Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka, Tempaku, Toyohashi 441-8580, Japan#TAB#","institution_ids":["https://openalex.org/I136259955"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006109156"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.7443,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.84192799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"118","issue":"3","first_page":"199","last_page":"207"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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.9940000176429749,"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/vertex-cover","display_name":"Vertex cover","score":0.8876920342445374},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.8554099798202515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8285744786262512},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.70377516746521},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6716424226760864},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6476742029190063},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6009490489959717},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5735092759132385},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5642169117927551},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5404084920883179},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5148910284042358},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5146775841712952},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4795615077018738},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44617515802383423},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4296179413795471},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41944730281829834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4040108919143677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37976670265197754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33891868591308594},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.20524269342422485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09728887677192688}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8876920342445374},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.8554099798202515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8285744786262512},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.70377516746521},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6716424226760864},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6476742029190063},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6009490489959717},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5735092759132385},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5642169117927551},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5404084920883179},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5148910284042358},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5146775841712952},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4795615077018738},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44617515802383423},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4296179413795471},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41944730281829834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4040108919143677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37976670265197754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33891868591308594},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.20524269342422485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09728887677192688},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(00)00383-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00383-8","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"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/W1488947681","https://openalex.org/W1843974934","https://openalex.org/W1988133548","https://openalex.org/W2000869424","https://openalex.org/W2038225707","https://openalex.org/W2059608229","https://openalex.org/W2083165612","https://openalex.org/W2087226760","https://openalex.org/W2100440346","https://openalex.org/W2122858887","https://openalex.org/W2128024934","https://openalex.org/W2143391442","https://openalex.org/W2143996311","https://openalex.org/W2156760067","https://openalex.org/W2327315803","https://openalex.org/W2799004609","https://openalex.org/W3034528871","https://openalex.org/W3043081082","https://openalex.org/W4233756358","https://openalex.org/W6605693991","https://openalex.org/W7057663353","https://openalex.org/W7058007835"],"related_works":["https://openalex.org/W2063671489","https://openalex.org/W1966805076","https://openalex.org/W1847283922","https://openalex.org/W2141026984","https://openalex.org/W2047424666","https://openalex.org/W2766826477","https://openalex.org/W1968988491","https://openalex.org/W1548167816","https://openalex.org/W4387158556","https://openalex.org/W3204841430"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}