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 条
  • [1] Cut problems in graphs with a budget constraint
    Engelberg, Roee
    Koenemann, Jochen
    Leonardi, Stefano
    Naor, Joseph
    JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (02) : 262 - 279
  • [2] OPTIMIZATION PROBLEMS SUBJECT TO A BUDGET CONSTRAINT WITH ECONOMIES OF SCALE
    HILLESTAD, RJ
    OPERATIONS RESEARCH, 1975, 23 (06) : 1091 - 1098
  • [3] Constraint programming techniques for solving problems on graphs
    Sidorov, V
    Telerman, V
    Ushakov, D
    PERSPECTIVES OF SYSTEM INFORMATICS, 2000, 1755 : 424 - 433
  • [4] CONSTRAINT SATISFACTION PROBLEMS FOR REDUCTS OF HOMOGENEOUS GRAPHS
    Bodirsky, Manuel
    Martin, Barnaby
    Pinsker, Michael
    Pongracz, Andras
    SIAM JOURNAL ON COMPUTING, 2019, 48 (04) : 1224 - 1264
  • [5] Generating Cut Conjunctions in Graphs and Related Problems
    Leonid Khachiyan
    Endre Boros
    Konrad Borys
    Khaled Elbassioni
    Vladimir Gurvich
    Kazuhisa Makino
    Algorithmica, 2008, 51 : 239 - 263
  • [6] Generating cut conjunctions in graphs and related problems
    Khachiyan, Leonid
    Boros, Endre
    Borys, Konrad
    Elbassioni, Khaled
    Gurvich, Vladimir
    Makino, Kazuhisa
    ALGORITHMICA, 2008, 51 (03) : 239 - 263
  • [7] NONDIMENSIONAL GRAPHS FOR SOLUTION OF BENDING PROBLEMS WITH AXIAL CONSTRAINT
    URY, JF
    ISRAEL JOURNAL OF TECHNOLOGY, 1966, 4 (04): : 256 - &
  • [8] Domination and Cut Problems on Chordal Graphs with Bounded Leafage
    Esther Galby
    Dániel Marx
    Philipp Schepper
    Roohani Sharma
    Prafullkumar Tale
    Algorithmica, 2024, 86 : 1428 - 1474
  • [9] Domination and Cut Problems on Chordal Graphs with Bounded Leafage
    Galby, Esther
    Marx, Daniel
    Schepper, Philipp
    Sharma, Roohani
    Tale, Prafullkumar
    ALGORITHMICA, 2024, 86 (05) : 1428 - 1474
  • [10] BUDGET CUT
    JOSEY, EJ
    LIBRARY JOURNAL, 1969, 94 (15) : 2846 - &
12345