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, Israel;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy;Microsoft Research, Redmond, WA
Venue:
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Year:
2006

Citing 14
Cited 3

The complexity of multiway cuts (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
Finding $k$ Cuts within Twice the Optimal

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
An improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
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
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters

Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation algorithms for fragmenting a graph against a stochastically-located threat

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A derandomized approximation algorithm for the critical node detection problem

Computers and Operations Research

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.