Cut problems in graphs with a budget constraint

Authors:
Roee Engelberg;Jochen Könemann;Stefano Leonardi;Joseph (Seffi) Naor
Affiliations:
Computer Science Department, Technion, Haifa 32000, Israel;Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada;Dipartimento di Informatica e Sistemistica, Universití di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy;Computer Science Department, Technion, Haifa 32000, Israel
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 18
Cited 1

e-approximations with minimum packing constraint violation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A probabilistic analysis of the maximal covering location problem

Discrete Applied Mathematics - Special issue: local optimization
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal

SIAM Journal on Computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

SIAM Journal on Computing
Rounding algorithms for a geometric embedding of minimum multiway cut

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
The budgeted maximum coverage problem

Information Processing Letters
Increasing the weight of minimum spanning trees

Journal of Algorithms
An improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
Minimizing Congestion in General Networks

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A polynomial-time tree decomposition to minimize congestion

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Analyzing Single-Server Network Inhibition

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Euclidean distortion and the sparsest cut

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters

Strategic multiway cut and multicut games

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.