Computing minimum cuts by randomized search heuristics

DOI10.1007/S00453-009-9370-8zbMATH Open1211.90263OpenAlexW1978984733MaRDI QIDQ633832FDOQ633832

Authors: F. Neumann, Joachim Reichel, Martin Skutella 

Publication date: 30 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9370-8

Recommendations

• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• A new approach to the minimum cut problem
• scientific article; zbMATH DE number 742961
• Practical performance of efficient minimum cut algorithms
• Evolutionary computation in combinatorial optimization

zbMATH Keywords

multi-objective optimizationevolutionary algorithmsrandomized search heuristicsminimum \(s\)-\(t\)-cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Introduction to algorithms
• The Complexity of Multiterminal Cuts
• Combinatorial optimization. Theory and algorithms.
• STACS 2005
• Title not available (Why is that?)
• Computing minimum cuts by randomized search heuristics
• Minimum spanning trees made easier via multi-objective optimization
• Evolutionary Computation in Combinatorial Optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Advances in metaheuristics for hard optimization
• On the size of weights in randomized search heuristics

Cited In (13)

• Fixed-parameter evolutionary algorithms and the vertex cover problem
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems
• Computing minimum cuts by randomized search heuristics
• Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
• Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
• Heuristic and exact methods for the cutting sequencing problem
• On the effectiveness of immune inspired mutation operators in some discrete optimization problems
• Title not available (Why is that?)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• An $\NC$ Algorithm for Minimum Cuts

This page was built for publication: Computing minimum cuts by randomized search heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633832)