A new approach to the minimum cut problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A new technique for the link slice problem
- Maximum concurrent flows and minimum cuts
- Random sampling and greedy sparsification for matroid optimization problems
- On minimum cuts and the linear arrangement problem
- An improved approximation algorithm of MULTIWAY CUT.
- Robust optimization in the presence of uncertainty: a generic approach
- Computing girth and cogirth in perturbed graphic matroids
- Computing minimum multiway cuts in hypergraphs
- On cutting a few vertices from a graph
- Generalizing the all-pairs min cut problem
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Practical performance of efficient minimum cut algorithms
- On the \(k\)-cut problem
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- New approximations and hardness results for submodular partitioning problems
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Tracking paths
- Cuts in undirected graphs. II
- Minimum label \(s\)-\(t\) cut has large integrality gaps
- Hypergraph \(k\)-cut in randomized polynomial time
- Beating the 2-approximation factor for global bicut
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Computing finest mincut partitions of a graph and application to routing problems
- Unbalanced graph cuts with minimum capacity
- Radiocoloring in planar graphs: Complexity and approximations
- Improving on best-of-many-Christofides for \(T\)-tours
- Faster cut sparsification of weighted graphs
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Random sampling in cut, flow, and network design problems
- Derandomization through approximation, an NC algorithm for minimum cuts
- A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
- Clique Cover and Graph Separation
- All-pairs min-cut in sparse networks
- Finding first, second and third order graphs cuts
- The label cut problem with respect to path length and label frequency
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- Fast computation of small cuts via cycle space sampling
- An approach to the asymmetric multi-depot capacitated arc routing problem
- LP relaxation and tree packing for minimum k-cut
- scientific article; zbMATH DE number 3891429 (Why is no real title available?)
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Fast Distributed Computation of Cuts Via Random Circulations
- Minimum Cuts of Simple Graphs in Almost Always Linear Time
- A variation on the min cut linear arrangement problem
- scientific article; zbMATH DE number 4051023 (Why is no real title available?)
- scientific article; zbMATH DE number 177540 (Why is no real title available?)
- scientific article; zbMATH DE number 1256719 (Why is no real title available?)
- scientific article; zbMATH DE number 1318514 (Why is no real title available?)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- An \NC Algorithm for Minimum Cuts
- A simple min-cut algorithm
- scientific article; zbMATH DE number 1555934 (Why is no real title available?)
- scientific article; zbMATH DE number 1783770 (Why is no real title available?)
- Minimum cuts and sparsification in hypergraphs
- Practical minimum cut algorithms
- Certifying algorithms
- scientific article; zbMATH DE number 742961 (Why is no real title available?)
- Computing exact minimum cuts without knowing the graph
- Global and fixed-terminal cuts in digraphs
- A critical survey on the network optimization algorithms for evacuation planning problems
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Introduction to QUBO
- Recent developments in maximum flow algorithms
- Fast and deterministic approximations for \(k\)-cut
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
- Randomized contractions for multiobjective minimum cuts
- Stochastic Kronecker graphs
- A general framework for graph sparsification
- Practical minimum cut algorithms
- Finding robust minimum cuts
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Fast augmenting paths by random sampling from residual graphs
- Tracking paths
- Cache oblivious minimum cut
- A reactive GRASP with path relinking for capacitated clustering
- An optimal algorithm for the minimum edge cardinality cut surface problem
- Fundamentals of Computation Theory
- Network Analysis
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- Fast and Deterministic Approximations for k-Cut.
- Fixed parameter approximation scheme for min-max \(k\)-cut
- A new contraction technique with applications to congruency-constrained cuts
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Excluding a simple good pair approach to directed cuts
- Partitioning subclasses of chordal graphs with few deletions
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
- A new MILP formulation for the flying sidekick traveling salesman problem
- Partitioning subclasses of chordal graphs with few deletions
- Shift of pairwise similarities for data clustering
- Computing minimum cuts by randomized search heuristics
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Base force element method based on the complementary energy principle for the damage analysis of recycled aggregate concrete
This page was built for publication: A new approach to the minimum cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371680)
