Concepedia

Random Structures and Algorithms

Alan Frieze

2014 · 49 citations · 74 references

Concepts

Abstract

Abstract. We provide an introduction to the analysis of random combinatorial structures and some of the associated computational problems.

References

74

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

, , +17

Polynomial algorithms in linear programming

Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 2K citations

, , +10

The Traveling salesman problem: a computational study

Choice Reviews Online · 2007 · 1.8K citations

, , +8

Outline of an algorithm for integer solutions to linear programs

Ralph E. Gomory · Bulletin of the American Mathematical Society · 1958 · 1.4K citations · Full text

, , +9

A Dynamic Programming Approach to Sequencing Problems

Michael Held, Richard M. Karp · Journal of the Society for Industrial and Applied Mathematics · 1962 · 1.3K citations

, , +15