Publications

Export 33 results:
Author Title [ Type(Desc)] Year
Filters: Keyword is Approximation algorithms  [Clear All Filters]
Journal Articles
Khuller S, Kim Y-A.  2004.  Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
Khuller S, Pless R, Sussmann YJ.  2000.  Fault tolerant K-center problems. Theoretical Computer Science. 242(1–2):237-245.
Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A.  2006.  An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
Arya S, Mount D, Netanyahu NS, Silverman R, Wu AY.  1998.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  2007.  A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2009.  A unified approach to scheduling on unrelated parallel machines. J. ACM. 56(5):28:1–28:31-28:1–28:31.
Raykar V C, Duraiswami R.  2006.  Very fast optimal bandwidth selection for univariate kernel density estimation. Technical Reports from UMIACS UMIACS-TR-2005-73.
Caprara A, Italiano GF, Mohan G, Panconesi A, Srinivasan A.  2002.  Wavelength rerouting in optical networks, or the Venetian Routing problem. Journal of Algorithms. 45(2):93-125.

Pages