{"id":"https://openalex.org/W2417586110","doi":"https://doi.org/10.1145/2897518.2897635","title":"Approximating connectivity domination in weighted bounded-genus graphs","display_name":"Approximating connectivity domination in weighted bounded-genus graphs","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2417586110","doi":"https://doi.org/10.1145/2897518.2897635","mag":"2417586110"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897635","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["ENS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENS, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059014964","display_name":"\u00c9ric Colin de Verdi\u00e8re","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"\u00c9ric Colin de Verdi\u00e8re","raw_affiliation_strings":["CNRS, France / ENS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, France / ENS, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":["Brown University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, USA","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035864448","display_name":"Claire Mathieu","orcid":"https://orcid.org/0000-0002-0517-112X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claire Mathieu","raw_affiliation_strings":["CNRS, France / ENS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, France / ENS, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045871494","display_name":"David Meierfrankenfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Meierfrankenfeld","raw_affiliation_strings":["Brown University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, USA","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"584","last_page":"597"},"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.9972000122070312,"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.9972000122070312,"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.9951000213623047,"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/T10083","display_name":"Graphene research and applications","score":0.9718000292778015,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.8010653257369995},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6555716395378113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6429519057273865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.638729453086853},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.611187756061554},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5809767246246338},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5708463191986084},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5675841569900513},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5673720836639404},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.563012421131134},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5473251342773438},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5240926146507263},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.49436092376708984},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4899884760379791},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.47063350677490234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46744000911712646},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.45886701345443726},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.441936194896698},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41119584441185},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4103025794029236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29044756293296814},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12888669967651367}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8010653257369995},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6555716395378113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6429519057273865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.638729453086853},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.611187756061554},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5809767246246338},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5708463191986084},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5675841569900513},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5673720836639404},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.563012421131134},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5473251342773438},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5240926146507263},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.49436092376708984},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4899884760379791},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.47063350677490234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46744000911712646},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.45886701345443726},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.441936194896698},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41119584441185},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4103025794029236},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29044756293296814},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12888669967651367},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2897518.2897635","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02169515v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02169515","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":"the 48th Annual ACM SIGACT Symposium on Theory of Computing, Jun 2016, Cambridge, United States. pp.584-597","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8717141228","display_name":"Algorithmic Techniques for Restricted Data Access Models","funder_award_id":"ANR-12-BS02-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1551429295","https://openalex.org/W1562281457","https://openalex.org/W1598441350","https://openalex.org/W1673084046","https://openalex.org/W1826939887","https://openalex.org/W1965737603","https://openalex.org/W1979312598","https://openalex.org/W1982180670","https://openalex.org/W1987965173","https://openalex.org/W1993589418","https://openalex.org/W2011039300","https://openalex.org/W2017106977","https://openalex.org/W2017302564","https://openalex.org/W2019137761","https://openalex.org/W2022082910","https://openalex.org/W2030509174","https://openalex.org/W2038643780","https://openalex.org/W2042509875","https://openalex.org/W2045349136","https://openalex.org/W2047723482","https://openalex.org/W2049413646","https://openalex.org/W2055805234","https://openalex.org/W2059273723","https://openalex.org/W2062254875","https://openalex.org/W2065161629","https://openalex.org/W2067078311","https://openalex.org/W2067431706","https://openalex.org/W2076461672","https://openalex.org/W2081880478","https://openalex.org/W2085348754","https://openalex.org/W2089847997","https://openalex.org/W2091757422","https://openalex.org/W2093766264","https://openalex.org/W2098361906","https://openalex.org/W2113901576","https://openalex.org/W2114791943","https://openalex.org/W2120424341","https://openalex.org/W2125350407","https://openalex.org/W2132169470","https://openalex.org/W2134947918","https://openalex.org/W2142607374","https://openalex.org/W2145145566","https://openalex.org/W2147562558","https://openalex.org/W2148371453","https://openalex.org/W2156760067","https://openalex.org/W2156896570","https://openalex.org/W2160167461","https://openalex.org/W2165094933","https://openalex.org/W2166242192","https://openalex.org/W2169848785","https://openalex.org/W2199785256","https://openalex.org/W2204196730","https://openalex.org/W2499710379","https://openalex.org/W2762935521","https://openalex.org/W3141863997","https://openalex.org/W4206696315","https://openalex.org/W4244206605"],"related_works":["https://openalex.org/W1966805076","https://openalex.org/W2359923140","https://openalex.org/W1848055413","https://openalex.org/W1890004479","https://openalex.org/W9203110","https://openalex.org/W3150189735","https://openalex.org/W1968988491","https://openalex.org/W2386614357","https://openalex.org/W2037935057","https://openalex.org/W2417586110"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,58],"framework":[3],"for":[4,25,62,76],"addressing":[5],"several":[6],"problems":[7,28,79],"on":[8],"weighted":[9,81],"planar":[10,30,67],"graphs":[11,13,31,33],"and":[12,40,50],"of":[14,34,87,89],"bounded":[15,35],"genus.":[16],"With":[17],"that":[18],"framework,":[19],"we":[20,56],"derive":[21],"polynomial-time":[22,59,73,92],"approximation":[23,60,74,93],"schemes":[24,75,94],"the":[26,71],"following":[27],"in":[29,66,80],"or":[32],"genus:":[36],"edge-weighted":[37],"tree":[38],"cover":[39],"tour":[41],"cover;":[42],"vertex-weighted":[43],"connected":[44,51],"dominating":[45],"set,":[46],"max-weight-leaf":[47],"spanning":[48],"tree,":[49],"vertex":[52,64],"cover.":[53],"In":[54],"addition,":[55],"obtain":[57],"scheme":[61],"feedback":[63],"set":[65],"graphs.":[68,83],"These":[69],"are":[70],"first":[72],"all":[77],"those":[78],"embedded":[82],"(For":[84],"unweighted":[85],"versions":[86],"some":[88],"these":[90],"problems,":[91],"were":[95],"previously":[96],"given":[97],"using":[98],"bidimensionality.)":[99]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}