Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract)

Authors:
George S. Lueker
Affiliations:
-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 3
Cited 1

On Approximation Methods for the Assignment Problem

Journal of the ACM (JACM)
Fast probabilistic algorithms for hamiltonian circuits and matchings

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The analysis of double hashing(Extended Abstract)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Random matroids

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

we consider optimization problems on complete graphs with edge weights chosen from identical but independent normal distributions. We show some very general techniques for obtaining upper and lower bounds on the asymptotic behavior of these problems. Often, but not always, these bounds are equal, enabling us to state the asymptotic behavior of the maximum. Problems in which the bounds are tight include finding the optimum traveling salesman tour, finding a minimum cost spanning tree, and finding a heaviest clique on k vertices. We then discuss some greedy heuristic algorithms for these problems.