#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1995

2018

- This year (4)
- Last 5 years (16)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
- J. ACM
- 2004

We present a general technique for approximating various descriptors of the extent of a set <i>P</i> of <i>n</i> points in R<sup><i>d</i></sup> when the dimension <i>d</i> is an arbitrary fixed… (More)

- Kenneth L. Clarkson, Kasturi R. Varadarajan
- Symposium on Computational Geometry
- 2005

Given a collection S of subsets of some set U, and M ⊂ U, the set cover problem is to find the smallest subcollection C ⊂ S such that M is a subset of the union of the sets in C. While the general… (More)

The paradigm of coresets has recently emerged as a powerful tool for efficiently approximating various extent measures of a point set P . Using this paradigm, one quickly computes a small subset Q of… (More)

- Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- WALCOM
- 2009

In the k-means problem, we are given a finite set S of points in Rm, and integer k ≥ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance of… (More)

- Pankaj K. Agarwal, Kasturi R. Varadarajan
- Discrete & Computational Geometry
- 2000

Abstract. We consider the problem of approximating a polygonal chain C by another polygonal chain C' whose vertices are constrained to be a subset of the set of vertices of C . The goal is to… (More)

We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete version of tâtonnement,… (More)

- Kasturi R. Varadarajan
- STOC
- 2010

There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known with approximation… (More)

The problem of computing equilibria for exchange economies has recently started to receive a great deal of attention in the theoretical computer science community. It has been shown that equilibria… (More)

Given a graph <i>G</i> = (<i>V,E</i>) and positive integral vertex weights <i>w</i> : <i>V</i> → N, the <i>max-coloring problem</i> seeks to find a proper vertex coloring of <i>G</i> whose color… (More)

- Sariel Har-Peled, Kasturi R. Varadarajan
- Symposium on Computational Geometry
- 2002

(MATH) Let <i>P</i> be a set of <i>n</i> points in $\Re<sup>d</sup>, and for any integer <i>0</i> &xie; <i>k</i> &xie; <i>d</i>--1, let $\RD<inf>k</inf>(<i>P</i>) denote the minimum over all… (More)