{"id":"https://openalex.org/W7147518214","doi":"https://doi.org/10.48550/arxiv.2603.29381","title":"Parameterized Algorithms for Computing MAD Trees","display_name":"Parameterized Algorithms for Computing MAD Trees","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147518214","doi":"https://doi.org/10.48550/arxiv.2603.29381"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.29381","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29381","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.29381","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047653179","display_name":"Tom-Lukas Breitkopf","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Breitkopf, Tom-Lukas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042414939","display_name":"Vincent Froese","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Froese, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111924259","display_name":"A. Herrmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Herrmann, Anton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nichterlein, Andr\u00e9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5115817675","display_name":"Camille Richer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richer, Camille","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6837999820709229,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.6837999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.23520000278949738,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.04780000075697899,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8055999875068665},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4950000047683716},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4758000075817108},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4702000021934509},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4668999910354614},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4546000063419342},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4392000138759613},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4235000014305115},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.41339999437332153}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8055999875068665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5863000154495239},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4950000047683716},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4702000021934509},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4668999910354614},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45089998841285706},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4392000138759613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4350999891757965},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4235000014305115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4185999929904938},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.41339999437332153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3707999885082245},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.34790000319480896},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.3206999897956848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31779998540878296},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3127000033855438},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.295199990272522},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.2946000099182129},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.29381","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29381","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.29381","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29381","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,58,147],"consider":[1],"the":[2,46,50,65,69,75,102,105,109,113],"well-studied":[3],"problem":[4,27,51,114],"of":[5,49,67,71,89,99,104],"finding":[6],"a":[7,18,23,60,84,94],"spanning":[8],"tree":[9,77],"with":[10,64,118,126,151],"minimum":[11],"average":[12],"distance":[13],"between":[14],"vertex":[15,140],"pairs":[16],"(called":[17],"MAD":[19,76],"tree).":[20],"This":[21],"is":[22,29,115,134],"classic":[24],"network":[25],"design":[26],"which":[28],"known":[30],"to":[31,120,128],"be":[32],"NP-hard.":[33],"While":[34],"approximation":[35],"algorithms":[36,39,150],"and":[37,93,123],"polynomial-time":[38,95],"for":[40,74,87,97],"some":[41],"graph":[42],"classes":[43],"are":[44],"known,":[45],"parameterized":[47,61,138],"complexity":[48,62],"has":[52],"not":[53],"been":[54],"investigated":[55],"so":[56],"far.":[57],"start":[59],"analysis":[63],"goal":[66],"determining":[68],"border":[70],"algorithmic":[72],"tractability":[73],"problem.":[78],"To":[79],"this":[80],"end,":[81],"we":[82,131],"provide":[83],"linear-time":[85],"algorithm":[86,96],"graphs":[88,98],"constant":[90],"modular":[91,121],"width":[92,122],"bounded":[100],"treewidth;":[101],"degree":[103],"polynomial":[106],"depends":[107],"on":[108,153],"treewidth.":[110,129],"That":[111],"is,":[112],"in":[116,124,135],"FPT":[117,136],"respect":[119,127],"XP":[125],"Moreover,":[130],"show":[132],"it":[133],"when":[137],"by":[139,143],"integrity":[141],"or":[142],"an":[144],"above-guarantee":[145],"parameter.":[146],"complement":[148],"these":[149],"NP-hardness":[152],"split":[154],"graphs.":[155]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}