Publications
Export 33 results:
Author Title [ Type] Year Filters: Keyword is Approximation algorithms [Clear All Filters]
2006. Achieving anonymity via clustering. Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. :153-162.
2008. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1166-1174.
2011. Approximation algorithms for throughput maximization in wireless networks with delay constraints. 2011 Proceedings IEEE INFOCOM. :1116-1124.
2005. Broadcasting on networks of workstations. Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :279-288.
2010. On Computing Compression Trees for Data Collection in Wireless Sensor Networks. 2010 Proceedings IEEE INFOCOM. :1-9.
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.
2002. Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
2001. Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
2010. A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
2006. On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
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.
1998. Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
2002. A local search approximation algorithm for k-means clustering. Proceedings of the eighteenth annual symposium on Computational geometry. :10-18.
2011. Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
2009. Minimizing Communication Cost in Distributed Multi-query Processing. IEEE 25th International Conference on Data Engineering, 2009. ICDE '09. :772-783.
2010. New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
1997. A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
2000. Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters. 74(1–2):19-25.
2010. Approximation algorithm for the kinetic robust K-center problem. Computational Geometry. 43(6–7):572-586.
2000. Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.