Randomized contractions for multiobjective minimum cuts
From MaRDI portal
Publication:5111689
Recommendations
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
- Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
- A new contraction technique with applications to congruency-constrained cuts
- A new contraction technique with applications to congruency-constrained cuts
- A new approach to the minimum cut problem
Cites work
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- A new approach to the minimum cut problem
- A new approximation algorithm for the unbalanced min s-t cut problem
- A simple min-cut algorithm
- Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
- Algorithms – ESA 2005
- An efficient algorithm for the minimum capacity cut problem
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Computing All Small Cuts in an Undirected Network
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Connectivity interdiction
- Introduction to algorithms
- Minimizing symmetric submodular functions
- Multicriteria global minimum cuts
- Multicriteria optimization
- Unbalanced graph partitioning
Cited in
(4)
This page was built for publication: Randomized contractions for multiobjective minimum cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111689)
