Export 33 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is Approximation algorithms  [Clear All Filters]
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.
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.
Aggarwal G, Panigrahy R, Feder T, Thomas D, Kenthapadi K, Khuller S, Zhu A.  2010.  Achieving anonymity via clustering. ACM Trans. Algorithms. 6(3):49:1–49:19-49:1–49:19.
Friedler SA, Mount D.  2010.  Approximation algorithm for the kinetic robust K-center problem. Computational Geometry. 43(6–7):572-586.
Li J, Deshpande A, Khuller S.  2010.  On Computing Compression Trees for Data Collection in Wireless Sensor Networks. 2010 Proceedings IEEE INFOCOM. :1-9.
Mount D, Park E.  2010.  A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
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.
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.
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.
Chafekar D, Kumart VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2008.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1166-1174.
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.
Aggarwal G, Feder T, Kenthapadi K, Khuller S, Panigrahy R, Thomas D, Zhu A.  2006.  Achieving anonymity via clustering. Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. :153-162.
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.
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.
Raykar V C, Duraiswami R.  2006.  Very fast optimal bandwidth selection for univariate kernel density estimation. Technical Reports from UMIACS UMIACS-TR-2005-73.
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.
Srinivasan A.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
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.
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.
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.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Arya S, Mount D.  2000.  Approximate range searching. Computational Geometry. 17(3–4):135-152.
Baveja A, Srinivasan A.  2000.  Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters. 74(1–2):19-25.