Author of the publication

Probabilistic analysis of some euclidean clustering problems.

. Discret. Appl. Math., 2 (4): 295-309 (1980)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Spanning Maximal Planar Subgraphs of Random Graphs., and . Random Struct. Algorithms, 2 (2): 225-232 (1991)Probabilistic Analysis of the Generalised Assignment Problem., and . IPCO, page 189-200. University of Waterloo Press, (1990)Random Walks on Random Graphs., and . NanoNet, volume 3 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 95-106. Springer, (2008)Min-Wise Independent Permutations, , , and . Journal of Computer and System Sciences, 60 (3): 630--659 (2000)Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)., , , and . Dagstuhl Reports, 1 (6): 24-53 (2011)The cover time of two classes of random graphs., and . SODA, page 961-970. SIAM, (2005)The probabilistic relationship between the assignment and asymmetric traveling salesman problems., and . SODA, page 652-660. ACM/SIAM, (2001)Edge-disjoint paths in expander graphs.. SODA, page 717-725. ACM/SIAM, (2000)On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas., , and . SODA, page 322-330. ACM/SIAM, (1993)Approximately Counting Hamilton Cycles in Dense Graphs., , and . SODA, page 336-343. ACM/SIAM, (1994)