Items where Author is "Sabharwal, Yogish"

Krishnaswamy, Ravishankar ; Kumar, Amit ; Nagarajan, Viswanath ; Sabharwal, Yogish ; Saha, Barna (2013) The Matroid Median Problem In: Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Chakaravarthy, Venkatesan T. ; Kumar, Amit ; Roy, Sambuddha ; Sabharwal, Yogish (2011) Resource Allocation for Covering Time Varying Demands Lecture Notes in Computer Science, 6942 . pp. 543-554. ISSN 0302-9743

Chakaravarthy, Venkatesan T. ; Kumar, Amit ; Pandit, Vinayaka ; Roy, Sambuddha ; Sabharwal, Yogish (2011) Scheduling Resources for Throughput Maximization Lecture Notes in Computer Science, 6845 . pp. 111-122. ISSN 0302-9743

Gupta, Manoj ; Sabharwal, Yogish ; Sen, Sandeep (2011) The update complexity of selection and related problems Foundations of Software Technology and Theoretical Computer Science . pp. 1-16.

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2010) Linear-time approximation schemes for clustering problems in any dimensions Journal of the ACM, 57 (2). No pp. given. ISSN 0004-5411

Kumar, Amit ; Sabharwal, Yogish (2007) The Priority k-Median Problem Lecture Notes in Computer Science, 4855 . pp. 71-83. ISSN 0302-9743

Sabharwal, Yogish ; Sharma, Nishant ; Sen, Sandeep (2006) Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions Journal of Computer and System Sciences, 72 (6). pp. 955-977. ISSN 0022-0000

Sabharwal, Yogish ; Sen, Sandeep (2005) A linear time algorithm for approximate 2-means clustering Computational Geometry, 32 (2). pp. 159-172. ISSN 0925-7721

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2005) Linear Time Algorithms for Clustering Problems in Any Dimensions Lecture Notes in Computer Science, 3580 . pp. 1374-1385. ISSN 0302-9743

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2005) Linear time algorithms for clustering problems in any dimensions International Colloquium on Automata, Languages and Programming . pp. 1374-1385.

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2004) A simple linear time ( 1+ ε)- approximation algorithm for geometric k-means clustering in any dimensions Proceedings - Annual Symposium on Foundations of Computer Science . pp. 454-462. ISSN 0272-5428