Randomized contractions for multiobjective minimum cuts
From MaRDI portal
Publication:5111689
DOI10.4230/LIPICS.ESA.2017.6zbMATH Open1442.68158MaRDI QIDQ5111689FDOQ5111689
Authors: Hassene Aissi, R. Ravi, A. R. Mahjoub 
Publication date: 27 May 2020
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
Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Cites Work
- Introduction to algorithms
- Multicriteria optimization
- Minimizing symmetric submodular functions
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Title not available (Why is that?)
- Unbalanced graph partitioning
- Title not available (Why is that?)
- A new approach to the minimum cut problem
- Computing All Small Cuts in an Undirected Network
- An efficient algorithm for the minimum capacity cut problem
- A simple min-cut algorithm
- Multicriteria global minimum cuts
- Algorithms – ESA 2005
- Connectivity interdiction
- Cardinality constrained minimum cut problems: complexity and algorithms.
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
- Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
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)
