Publications

Export 33 results:
Author [ Title(Asc)] Type Year
Filters: Keyword is Approximation algorithms  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
W
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.
V
Raykar V C, Duraiswami R.  2006.  Very fast optimal bandwidth selection for univariate kernel density estimation. Technical Reports from UMIACS UMIACS-TR-2005-73.
Srinivasan A.  2000.  The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
U
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.
P
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.
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  1997.  A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
O
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.
N
Haeupler B, Saha B, Srinivasan A.  2010.  New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
M
Li J, Deshpande A, Khuller S.  2009.  Minimizing Communication Cost in Distributed Multi-query Processing. IEEE 25th International Conference on Data Engineering, 2009. ICDE '09. :772-783.
Li J, Deshpande A.  2011.  Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
L
Kanungo T, Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2002.  A local search approximation algorithm for k-means clustering. Proceedings of the eighteenth annual symposium on Computational geometry. :10-18.
I
Radhakrishnan J, Srinivasan A.  1998.  Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
Srinivasan A.  1997.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings. :416-425.
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, Malamatos T, Mount D.  2006.  On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
F
Khuller S, Pless R, Sussmann YJ.  2000.  Fault tolerant K-center problems. Theoretical Computer Science. 242(1–2):237-245.
E
Khuller S, Kim Y-A.  2004.  Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
D
Mount D, Park E.  2010.  A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2002.  Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
C
Srinivasan A, Teo C-P.  1997.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.
Li J, Deshpande A, Khuller S.  2010.  On Computing Compression Trees for Data Collection in Wireless Sensor Networks. 2010 Proceedings IEEE INFOCOM. :1-9.
B
Khuller S, Kim Y-A, Wan Y-C J.  2005.  Broadcasting on networks of workstations. Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :279-288.
A
Pei G, Anil Kumar VS, Parthasarathy S, Srinivasan A.  2011.  Approximation algorithms for throughput maximization in wireless networks with delay constraints. 2011 Proceedings IEEE INFOCOM. :1116-1124.
Gandhi R, Khuller S, Srinivasan A.  2004.  Approximation algorithms for partial covering problems. Journal of Algorithms. 53(1):55-84.

Pages