Multicriteria Global Minimum Cuts

@article{Armon2006MulticriteriaGM,
  title={Multicriteria Global Minimum Cuts},
  author={Amitai Armon and Uri Zwick},
  journal={Algorithmica},
  year={2006},
  volume={46},
  pages={15-26}
}
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs associated with it. These costs are measured in separate, non-interchangeable, units. In the AND-version of the problem, purchasing an edge requires the payment of all the k costs associated with it. In the OR-version, an edge can be purchased by paying any one of the k costs associated with it. Given k bounds b1,b2… 

Multicriteria cuts and size-constrained k-cuts in hypergraphs

TLDR
This work shows that min-k-cut in hypergraphs subject to constant lower bounds on part sizes is solvable in polynomial-time for constant k, thus resolving an open problem posed by Guinez and Queyranne (Unpublished manuscript).

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

TLDR
The techniques illustrate the versatility of the random contraction approach to address counting and algorithmic problems concerning multiobjective min-cuts and size-constrained min-$k-cut in hypergraphs and the number of optimal solutions is polynomial.

Unbalanced graph cuts with minimum capacity

  • Peng Zhang
  • Computer Science, Business
    Frontiers of Computer Science
  • 2014
TLDR
It is proved that the min k-size s-t cut problem is NP-hard, and O(log n)-approximation algorithms for the mink-size S-T cut problem, the min Ek-sizeS-t Cut problem, and the min Eksize cut problem are given.

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

TLDR
It is shown that the number of non-dominated points is O(|V|7) and the first strongly polynomial time algorithm to compute these points is given and this results improve on significantly the super-polynomial bound on the parametric complexity given by Mulmuley.

Unbalanced Graph Partitioning

TLDR
A bicriteria approximation algorithm is given for the k-Sparsest Cut problem (to find a k-size cut with the minimum sparsity), which outputs a cut whose sparsity is at most O(logn) times the optimum and whose smaller side has size at least O( logn)k.

Randomized Contractions for Multiobjective Minimum Cuts

We show that Karger's randomized contraction method (SODA 93) can be adapted to multiobjective global minimum cut problems with a constant number of edge or node budget constraints to give efficient

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints

TLDR
The linear relaxation of the minimum \(s-t\) cut problem is considered and necessary and sufficient conditions for which it has an integral optimal basic solution are given.

On the Parameterized Complexity of Cutting a Few Vertices from a Graph

TLDR
The parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator is studied and it is shown that if the authors consider edge cuts instead of vertex cuts, the terminal variant of the problem is NP-hard.

A new approximation algorithm for the unbalanced Min s-t Cut problem

  • Peng Zhang
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2014

References

SHOWING 1-10 OF 22 REFERENCES

Some Complexity Results for k-Cardinality Minimum Cut Problems

TLDR
The k-cardinality minimum cut problem is studied, a new problem of this family of problems where the number of edges of the cut is constrained to be either less or greater than k, and complexity results in the most significant graph classes.

Cardinality constrained minimum cut problems: complexity and algorithms

A New Algorithm for Multi-objective Graph Partitioning

TLDR
This work presents a new formulation of the multi-objective graph partitioning problem and describes an algorithm that computes partitionings with respect to this formulation and explains how this algorithm provides the user with a fine-tuned control of the tradeoffs among the objectives, results in predictable partitionings, and is able to handle both similar and dissimilar objectives.

A new approach to the minimum cut problem

TLDR
A randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability with a significant improvement over the previous time bounds based on maximum flows.

On the approximability of trade-offs and optimal access of Web sources

TLDR
These concepts and techniques are applied to formulate and solve approximately a cost-time-quality trade-off for optimizing access to the World-Wide Web, in a model first studied by Etzioni et al. (1996).

Random sampling in cut, flow, and network design problems

TLDR
It is shown that the sparse graph, or skeleton, that arises when the authors randomly sample a graph's edges will accurately approximate the value of all cuts in the original graph with high probability, which makes sampling effective for problems involving cuts in graphs.

Approximation algorithms for scheduling unrelated parallel machines

TLDR
It is proved that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unless P = NP, and a complexity classification for all special cases with a fixed number of processing times is obtained.

Minimum cuts in near-linear time

TLDR
A "semiduality" between minimum cuts and maximum spanning tree packings combined with the previously developed random sampling techniques is used and known time bounds for solving the minimum cut problem on undirected graphs are significantly improved.

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

TLDR
An algorithm for computing the edge-connectivity of a multigraph, where p ( \leqq | E | )$ is the number of pairs of nodes between which G has an edge, is proposed and consists only of times of graph searches and edge contractions.

A simple min-cut algorithm

TLDR
An algorithm for finding the minimum cut of an undirected edge-weighted graph that has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness.