A
Aravind Srinivasan
Researcher at University of Maryland, College Park
Publications - 278
Citations - 14614
Aravind Srinivasan is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Approximation algorithm & Wireless network. The author has an hindex of 60, co-authored 266 publications receiving 13711 citations. Previous affiliations of Aravind Srinivasan include Graz University of Technology & Bell Labs.
Papers
More filters
Proceedings Article
A Pairwise Fair and Community-preserving Approach to k-Center Clustering
Brian Brubach,Darshan Chakrabarti,John P. Dickerson,Samir Khuller,Aravind Srinivasan,Leonidas Tsepenekas +5 more
TL;DR: This work formally defines two new types of fairness in the clustering setting, pairwise fairness and community preservation, and devise an approach for extending existing $k$-center algorithms to satisfy these fairness constraints.
Proceedings ArticleDOI
Rigorous Probabilistic Trust-Inference with Applications to Clustering
TL;DR: This work proposes a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph, which creates an inferred trust-metric space where the shorter the distance between two people, the higher their trust.
Journal ArticleDOI
Your friends have more friends than you do: identifying influential mobile users through random-walk sampling
TL;DR: It is proved that random-walk sampling with O(logn) steps, where n is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees, which makes iWander the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users.
Posted Content
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
TL;DR: In this article, a new lift-and-project-based SDP relaxation for the problem was introduced and a new bipartite-rounding procedure was given to produce an assignment with strong negative correlation properties.
Proceedings ArticleDOI
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Deepti Chafekar,Dave Levin,Vineet Kumar,Madhav V. Marathe,Srinivasan Parthasarathy,Aravind Srinivasan +5 more
TL;DR: This work designs simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible.