Items where Author is "Frieze, Alan"

Article

Frieze, Alan, Pegden, Wesley, Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 and Tkocz, Tomasz (2021) Minimum-weight combinatorial structures under random cost-constraints. Electronic Journal of Combinatorics, 28 (1). ISSN 1077-8926

Frieze, Alan, Pegden, Wesley and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2018) The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights. SIAM Journal on Discrete Mathematics, 32 (3). pp. 2115-2133. ISSN 0895-4801

Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2015) Efficient algorithms for three-dimensional axial and planar random assignment problems. Random Structures and Algorithms, 46 (1). 160 - 196. ISSN 1042-9832

Cooper, Colin, Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2007) Random 2-SAT with prescribed literal degrees. Algorithmica, 48 (3). pp. 249-265. ISSN 0178-4617

Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2006) The probabilistic relationship between the assignment and travelling salesman problems. SIAM Journal on Computing, 36 (5). pp. 1435-1452. ISSN 0097-5397

Book Section

Chebolu, Prasad, Frieze, Alan, Melsted, Páll and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2009) Average-case analyses of Vickrey costs. In: Dinur, Irit, Jansen, Klaus, Naor, Seffi and Rolim, José, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques:12th International Workshop, Approx 2009. Lecture notes in computer science (5687). Springer Berlin / Heidelberg, pp. 434-447. ISBN 9783642036842

Conference or Workshop Item

Cooper, Colin, Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2002) A note on random 2-SAT with prescribed literal degrees. In: Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002-01-06 - 2002-01-08, CA, United States, USA.

Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2001) The probabilistic relationship between the assignment and traveling salesman problems. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001-01-07 - 2001-01-09, DC, United States, USA.