2 papers
cs.DS2016
Distributed Construction of Purely Additive Spanners
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz +1
This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases.…
cs.DS2010
Popularity at Minimum Cost
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…