Следене
Alan Frieze
Заглавие
Позовавания
Позовавания
Година
Min-wise independent permutations
AZ Broder, M Charikar, AM Frieze, M Mitzenmacher
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
15261998
A random polynomial-time algorithm for approximating the volume of convex bodies
M Dyer, A Frieze, R Kannan
Journal of the ACM (JACM) 38 (1), 1-17, 1991
9691991
Fast Monte-Carlo algorithms for finding low-rank approximations
A Frieze, R Kannan, S Vempala
Journal of the ACM (JACM) 51 (6), 1025-1041, 2004
9412004
Introduction to random graphs
A Frieze, M Karoński
Cambridge University Press, 2015
8752015
Clustering large graphs via the singular value decomposition
P Drineas, A Frieze, R Kannan, S Vempala, V Vinay
Machine learning 56, 9-33, 2004
7162004
Quick approximation to matrices and applications
A Frieze, R Kannan
Combinatorica 19 (2), 175-220, 1999
6091999
Improved approximation algorithms for max k-cut and max bisection
A Frieze, M Jerrum
Algorithmica 18 (1), 67-81, 1997
5561997
A general model of web graphs
C Cooper, A Frieze
Random Structures & Algorithms 22 (3), 311-335, 2003
5322003
On the complexity of computing the volume of a polyhedron
ME Dyer, AM Frieze
SIAM Journal on Computing 17 (5), 967-974, 1988
4551988
The shortest-path problem for graphs with random arc-lengths
AM Frieze, GR Grimmett
Discrete Applied Mathematics 10 (1), 57-77, 1985
3601985
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
AM Frieze, G Galbiati, F Maffioli
Networks 12 (1), 23-39, 1982
3431982
On the value of a random minimum spanning tree problem
AM Frieze
Discrete Applied Mathematics 10 (1), 47-56, 1985
3121985
Analysis of Two Simple Heuristics on a Random Instance of k-sat
A Frieze, S Suen
Journal of Algorithms 20 (2), 312-355, 1996
2871996
A simple heuristic for the p-centre problem
ME Dyer, AM Frieze
Operations Research Letters 3 (6), 285-288, 1985
2801985
Clustering in Large Graphs and Matrices.
P Drineas, AM Frieze, R Kannan, SS Vempala, V Vinay
SODA 99, 291-299, 1999
2621999
The solution of some random NP-hard problems in polynomial expected time
ME Dyer, AM Frieze
Journal of Algorithms 10 (4), 451-489, 1989
2591989
The regularity lemma and approximation schemes for dense problems
A Frieze, R Kannan
Proceedings of 37th conference on foundations of computer science, 12-20, 1996
2501996
A polynomial-time algorithm for learning noisy linear threshold functions
A Blum, A Frieze, R Kannan, S Vempala
Algorithmica 22, 35-52, 1998
2481998
Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses
AM Frieze, MRB Clarke
European Journal of Operational Research 15 (1), 100-109, 1984
2401984
On the independence number of random graphs
AM Frieze
Discrete Mathematics 81 (2), 171-175, 1990
2391990
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20