Results 301 to 310 of about 380,355 (349)
Some of the next articles are maybe not open access.
A Probabilistic Analysis of Christofides’ Algorithm
2012Christofides' algorithm is a well known approximation algorithm for the metric travelling salesman problem. As a first step towards obtaining an average case analysis of Christofides' algorithm, we provide a probabilistic analysis for the stochastic version of the algorithm for the Euclidean traveling salesman problem, where the input consists of n ...
Markus Bläser +2 more
openaire +2 more sources
Probabilistic analysis of approximation algorithms
1999IN PREVIOUS chapters the performance of an approximate algorithm has been analyzed using a worst case point of view. In this chapter this condition is relaxed and the probabilistic analysis of an algorithm is performed by considering either the average case or the behavior in almost all cases.
Alberto Marchetti-Spaccamela +5 more
openaire +2 more sources
A probabilistic analysis of a barrier eliminating algorithm
2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2009Since barrier synchronization is a simple means to guarantee the order of data producing and data consuming, it is often used in parallel programs. However, barrier synchronization causes the processors' idle time to increase. To reduce the overhead of barrier synchronization, we have proposed an algorithm which eliminates barrier synchronizations and ...
Issei Kino, Naoki Yonezawa, Koichi Wada
openaire +2 more sources
A probabilistic analysis of the switching algorithm for the euclidean TSP [PDF]
Mathematical Programming, 1989 The 2-switching Algorithm for the Euclidean Traveling Salesman problem is studied. A probabilistic analysis is developed. It gives an evaluation of a simulated annealing version of the Lin-Kernigham algorithm. A bound of the number of points (n) and the minimum distance (d*) between a tour \(\sigma\) and that generated by switching points \(\tau_ i ...
openaire +2 more sources
Probabilistic Analysis of Disjoint Set Union Algorithms
SIAM Journal on Computing, 1993The Union-Find problem of \textit{A. V. Aho, J. E. Hopcroft} and \textit{J. D. Ullman} [The design and analysis of computer algorithms, Addison-Wesley Publ. Comp. (1974; Zbl 0326.68005)] consists of maintaining a representation of a partion of an \(n\)-set, where the operations are Find and Union. This problem arises in several applications.
Béla Bollobás, Istvan Simon
openaire +2 more sources
Probabilistic Analysis of Graph Algorithms
1990Probabilistic Analysis of Graph Algorithms. We review some of the known results on the average case performance of graph algorithms. The analysis assumes that the problem instances are randomly selected from some reasonable distribution of problems. We consider two types of problem.
openaire +2 more sources
Convergence Rates in the Probabilistic Analysis of Algorithms
International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2020Ralph Neininger, Jasmin Straub
semanticscholar +1 more source
Probabilistic analysis of an election algorithm in a tree
2005In this paper we consider the well-known case of election in a tree, and we study the probability for any vertex of a given tree to be elected. In particular, we show that if we consider the probability distribution based on the comparison of the election probabilities of neighbour vertices, there is one or two vertices having the highest probability ...
Yves Métivier, Nasser Saheb
openaire +2 more sources
Probabilistic analysis of graph colouring algorithms
1983In this paper we analyze algorithms for the graph colouring problem from a probabilistic point of view. Furthermore we show that the chromatic number of a graph converges to n log 1/q / 2 log n almost surely.
Maurizio Talamo +1 more
openaire +2 more sources