The time complexity of maximum matching by simulated annealing

@article{Sasaki1988TheTC,
  title={The time complexity of maximum matching by simulated annealing},
  author={Galen H. Sasaki and Bruce E. Hajek},
  journal={J. ACM},
  year={1988},
  volume={35},
  pages={387-403}
}
The random, heuristic search algorithm called simulated annealing is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that neither a basic form of the algorithm, nor any other algorithm in a fairly large related class of algorithms, can find maximum cardinality matchings such that the average time required grows as a polynomial in the number of nodes of the graph. In contrast, it is also shown for arbitrary graphs that a degenerate form of the basic… 
Time Complexity of Maximum Matching by an ( N + N ) Evolutionary Algorithm
An (N +N) evolutionary algorithm is considered for the problem of find ing the maximum cardinality matching in a graph. It is shown that the performance of the evolutionary algorithm is the same as
Simulated Annealing and Its Problems to Color Graphs
TLDR
In this paper an application of Simulated Annealing to the 3-coloring problem is considered and it is shown that the expected first hitting time of a proper coloring, given an arbitrary cooling scheme, is of exponential size.
Maximum cardinality matchings on trees by randomized local search
TLDR
This paper examines randomized local search (RLS) for graphs whose structure is simple and shows that RLS finds maximum matchings on trees in expected polynomial time.
Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching
  • Jun He, X. Yao
  • Computer Science
    Journal of Computer Science and Technology
  • 2008
TLDR
It is shown that the evolutionary algorithm can produce, a matching with nearly maximum cardinality in average polynomial time.
Simulated Annealing and Graph Colouring
TLDR
It is shown for a certain class of graphs that the expected first hitting time of a proper colouring, given an arbitrary cooling scheme, is of exponential size.
Evolutionary Algorithms and the Maximum Matching Problem
TLDR
It is proven that the evolutionary algorithm is a polynomial-time randomized approximation scheme (PRAS) for this optimization problem, although the algorithm does not employ the idea of augmenting paths.
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
  • I. Wegener, C. Witt
  • Mathematics, Computer Science
    Combinatorics, Probability and Computing
  • 2005
TLDR
An analysis of howRandomized search heuristics work on classes of functions, including the class of monotone pseudo-Boolean polynomials, results depending on the degree and the number of terms of the polynomial are obtained.
Maximum Cardinality Matching by Evolutionary Algorithms
The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This p aper considers the average time complexity of an evolutionary al gorithm for
On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search
TLDR
An analysis of howRandomized search heuristics work on classes of functions, including the class of monotone pseudo-boolean polynomials, results depending on the degree and the number of terms of the polynomial are obtained.
Searching Randomly for Maximum Matchings
  • O. Giel, I. Wegener
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2004
TLDR
The main purpose is to develop methods for the analysis of general randomized search heuristics and to investigate when it is possible to “simulate randomly” clever optimization techniques and when this random search fails.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Convergence and finite-time behavior of simulated annealing
Simulated Annealing is a randomized algorithm which has been proposed for finding globally optimum least-cost configurations in large NP-complete problems with cost functions which may have many
Convergence and finite-time behavior of simulated annealing
Simulated annealing is a randomized algorithm which has been proposed for finding globally optimum least-cost configurations in large NP-complete problems with cost functions which may have many
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
  • S. Micali, V. Vazirani
  • Mathematics, Computer Science
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
TLDR
An 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs works in 'phases'.
Analysis of simulated annealing for optimization
TLDR
This work analyzes a nonstationary finite state Markov chain whose state space Ω is the domain of the cost function to be minimized, and considers an arbitrary partition optimization {I, J} of Ω of this chain focusing on those issues most important for optimization.
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generates randomly the permutations of the stations of the traveling salesman trip,
Cooling Schedules for Optimal Annealing
  • B. Hajek
  • Computer Science, Mathematics
    Math. Oper. Res.
  • 1988
A Monte Carlo optimization technique called “simulated annealing” is a descent algorithm modified by random ascent moves in order to escape local minima which are not global minima. The level of
SIMULATED ANNEALING METHODS WITH GENERAL ACCEPTANCE PROBABILITIES
Heuristic solution methods for combinatorial optimization problems are often based on local neighborhood searches. These tend to get trapped in a local optimum and the final result is often heavily
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Global Wiring by Simulated Annealing
  • M. Vecchi, S. Kirkpatrick
  • Physics, Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1983
Simulated annealing, a new general-purpose method of multivariate optimization, is applied to global wire routing for both idealized (synthetic) and actual designs of realistic size and complexity.
...
1
2
...