Let G = (V, E) be an undirected weighted graph on |V | = n vertices, and |E| = m edges. A t-spanner of the graph G, for any t â‰¥ 1, is a subgraph (V, ES), ES âŠ† E, such that the distance between anyâ€¦ (More)

We present the first linear time (1+Îµ)-approximation algorithm for the k-means problem for fixed k and Îµ. Our algorithm runs in O(nd) time, which is linear in the size of the input. Another featureâ€¦ (More)

<italic>In this paper we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly like the terrain maps. Aâ€¦ (More)

2011 IEEE 52nd Annual Symposium on Foundations ofâ€¦

2011

We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes $O( \log n)$ expected amortized time for eachâ€¦ (More)

We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameters. Our cache model,â€¦ (More)