Fast FPT-Approximation of Branchwidth

近似算法 计算机科学 组合数学 数学 算法
作者
Fedor Fomin,Tuukka Korhonen
出处
期刊:SIAM Journal on Computing [Society for Industrial and Applied Mathematics]
卷期号:53 (4): 1085-1131
标识
DOI:10.1137/22m153937x
摘要

.Branchwidth determines how graphs and, more generally, arbitrary connectivity (symmetric and submodular) functions can be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing fixed-parameter tractable 2-approximation algorithms for branchwidth of connectivity functions. The first ingredient of our framework is combinatorial. We prove a structural theorem establishing that either a sequence of particular refinement operations can decrease the width of a branch decomposition or the width of the decomposition is already within a factor of 2 from the optimum. The second ingredient is an efficient implementation of the refinement operations for branch decompositions that support efficient dynamic programming. We present two concrete applications of our general framework. The first is an algorithm that, for a given \(n\) -vertex graph \(G\) and integer \(k\) , in time \(2^{2^{\mathcal{O}(k)}} n^2\) either constructs a rank decomposition of \(G\) of width at most \(2k\) or concludes that the rankwidth of \(G\) is more than \(k\) . It also yields a \((2^{2k+1}-1)\) -approximation algorithm for cliquewidth within the same time complexity, which in turn improves to \(f(k) \cdot n^2\) the running times of various algorithms on graphs of cliquewidth \(k\) . Breaking the "cubic barrier" for rankwidth and cliquewidth was an open problem in the area. The second application is an algorithm that, for a given \(n\) -vertex graph \(G\) and integer \(k\) , in time \(2^{\mathcal{O}(k)} n\) either constructs a branch decomposition of \(G\) of width at most \(2k\) or concludes that the branchwidth of \(G\) is more than \(k\) . This improves over the 3-approximation that follows from the recent treewidth 2-approximation of Korhonen [FOCS 2021].Keywordsbranchwidthrankwidthcliquewidthgraph algorithmsparameterized algorithmsapproximation algorithmsMSC codes68Q2568R1068Q27
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
xy发布了新的文献求助10
刚刚
忧心的惜天完成签到 ,获得积分10
2秒前
2秒前
2秒前
3秒前
ED应助xeh采纳,获得10
4秒前
4秒前
Li656943234发布了新的文献求助20
4秒前
王悦阳完成签到,获得积分10
5秒前
5秒前
慕月发布了新的文献求助10
5秒前
顺心的安珊完成签到,获得积分10
6秒前
abcd1234完成签到,获得积分10
7秒前
8秒前
9秒前
dumpling应助黎耀辉采纳,获得30
10秒前
教授王发布了新的文献求助10
10秒前
Tiscen发布了新的文献求助10
10秒前
syzz发布了新的文献求助10
10秒前
taotao216发布了新的文献求助30
11秒前
11秒前
六六关注了科研通微信公众号
12秒前
ZW完成签到,获得积分10
12秒前
13秒前
Lay完成签到,获得积分20
13秒前
wj发布了新的文献求助10
13秒前
orixero应助YIFEI采纳,获得30
14秒前
桀桀桀完成签到,获得积分10
14秒前
知性的钢笔完成签到,获得积分10
15秒前
15秒前
wualexandra发布了新的文献求助10
15秒前
牛雨桐发布了新的文献求助10
16秒前
17秒前
17秒前
17秒前
传奇3应助水晶鞋小兔头采纳,获得10
17秒前
17秒前
慕月完成签到,获得积分10
18秒前
单纯铃铛发布了新的文献求助10
18秒前
可靠的千愁完成签到,获得积分20
18秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Picture Books with Same-sex Parented Families: Unintentional Censorship 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
A Preliminary Study on Correlation Between Independent Components of Facial Thermal Images and Subjective Assessment of Chronic Stress 500
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 360
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3970802
求助须知:如何正确求助?哪些是违规求助? 3515474
关于积分的说明 11178714
捐赠科研通 3250627
什么是DOI,文献DOI怎么找? 1795390
邀请新用户注册赠送积分活动 875818
科研通“疑难数据库(出版商)”最低求助积分说明 805183