{"id":"https://openalex.org/W4285146977","doi":"https://doi.org/10.1007/978-3-031-06901-7_9","title":"A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in $$\\mathsf {FPT}$$ Time","display_name":"A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in $$\\mathsf {FPT}$$ Time","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285146977","doi":"https://doi.org/10.1007/978-3-031-06901-7_9"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-06901-7_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06901-7_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research Zurich, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041355842","display_name":"Tobias M\u00f6mke","orcid":"https://orcid.org/0000-0002-2509-6972"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias M\u00f6mke","raw_affiliation_strings":["Department of Computer Science, University of Augsburg, Augsburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Augsburg, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049868915","display_name":"V\u00edctor Verdugo","orcid":"https://orcid.org/0000-0003-0817-7356"},"institutions":[{"id":"https://openalex.org/I4210144665","display_name":"University of O'Higgins","ror":"https://ror.org/044cse639","country_code":"CL","type":"education","lineage":["https://openalex.org/I4210144665"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Victor Verdugo","raw_affiliation_strings":["Institute of Engineering Sciences, Universidad de O\u2019Higgins, Rancagua, Chile","Institute of Engineering Sciences, Universidad de O'Higgins, Rancagua, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Engineering Sciences, Universidad de O\u2019Higgins, Rancagua, Chile","institution_ids":["https://openalex.org/I4210144665"]},{"raw_affiliation_string":"Institute of Engineering Sciences, Universidad de O'Higgins, Rancagua, Chile","institution_ids":["https://openalex.org/I4210144665"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049868915"],"corresponding_institution_ids":["https://openalex.org/I4210144665"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"112","last_page":"125"},"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.9994999766349792,"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.9994999766349792,"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.998199999332428,"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.9958999752998352,"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/treewidth","display_name":"Treewidth","score":0.8801230192184448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7767711281776428},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6606029272079468},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6412330269813538},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6277624368667603},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5957500338554382},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5950417518615723},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5231388807296753},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49032142758369446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4838937222957611},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.42981356382369995},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41706326603889465},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.41679689288139343},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3738369941711426},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2825206518173218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19827786087989807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16621732711791992},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07909005880355835}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8801230192184448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7767711281776428},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6606029272079468},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6412330269813538},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6277624368667603},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5957500338554382},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5950417518615723},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5231388807296753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49032142758369446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4838937222957611},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.42981356382369995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41706326603889465},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.41679689288139343},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3738369941711426},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2825206518173218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19827786087989807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16621732711791992},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07909005880355835},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-06901-7_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06901-7_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1870858037","https://openalex.org/W1902724346","https://openalex.org/W1989720410","https://openalex.org/W1992520677","https://openalex.org/W2015577846","https://openalex.org/W2017713020","https://openalex.org/W2049143039","https://openalex.org/W2071588464","https://openalex.org/W2080394239","https://openalex.org/W2088844265","https://openalex.org/W2098492709","https://openalex.org/W2115163112","https://openalex.org/W2154876245","https://openalex.org/W2161719898","https://openalex.org/W2568140225","https://openalex.org/W2619061098","https://openalex.org/W2801165240","https://openalex.org/W2900646172","https://openalex.org/W3042827292","https://openalex.org/W3116926108","https://openalex.org/W3126458647","https://openalex.org/W4250589301","https://openalex.org/W4285146977","https://openalex.org/W4400691701"],"related_works":["https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W3100114454","https://openalex.org/W2035016254","https://openalex.org/W2507810539","https://openalex.org/W2952055179","https://openalex.org/W4302786124","https://openalex.org/W3198523758","https://openalex.org/W4287552035","https://openalex.org/W1600160158"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2022-07-14T00:00:00"}