|
 | Up a level |
Scott, Alexander D. and Sorkin, Gregory B. 
ORCID: 0000-0003-4935-7820
(2009)
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.
ACM Transactions on Algorithms, 5 (4).
45:1-27.
ISSN 1549-6325
Scott, Alexander D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820
(2007)
Linear-programming design and analysis of fast algorithms for Max 2-CSP.
Discrete Optimization, 4 (3-4).
pp. 260-287.
ISSN 1572-5286
Scott, Alexander D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820
(2006)
An LP-designed algorithm for constraint satisfaction.
In: Azar, Yossi and Erlebach, Thomas, (eds.)
Algorithms - Esa 2006. 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings.
Lecture notes in computer science (4168).
Springer Berlin / Heidelberg, pp. 588-599.
ISBN 9783540388753
Scott, Alexander D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820
(2006)
Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time.
Combinatorics, Probability and Computing, 15 (1-2).
pp. 281-315.
ISSN 0963-5483
Scott, Alexander D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820
(2003)
Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances.
In: Arora, S., Jansen, K., Rolim, J.D.P. and Sahai, A., (eds.)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. 6th International Workshop on Approxima.
Lecture notes in computer science (2764).
Springer Berlin / Heidelberg, pp. 382-395.
ISBN 9783540407706
