Publications
Export 33 results:
Author [ Title] Type Year Filters: Keyword is Approximation algorithms [Clear All Filters]
2010. New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
2007. A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
1997. A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
2009. A unified approach to scheduling on unrelated parallel machines. J. ACM. 56(5):28:1–28:31-28:1–28:31.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
2006. Very fast optimal bandwidth selection for univariate kernel density estimation. Technical Reports from UMIACS UMIACS-TR-2005-73.
2002. Wavelength rerouting in optical networks, or the Venetian Routing problem. Journal of Algorithms. 45(2):93-125.