Cut problems in graphs with a budget constraint

被引：5
|
作者：
Engelberg, R [1 ]
Könemann, J
Leonardi, S
Naor, J
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[3] Univ Roma La Sapienza, Dipartimento Informat & Sistemist, I-00198 Rome, Italy
[4] Microsoft Res, Redmond, WA 98052 USA
来源：
LATIN 2006: THEORETICAL INFORMATICS | 2006年 / 3887卷
关键词：
D O I：
10.1007/11682462_41
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study budgeted variants of classical cut; problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest cut problem, and we provide a bi-criteria approximation algorithm for it.
引用
收藏
页码：435 / 446
页数：12
相关论文
共 50 条
12345