Ranking algorithms find extensive usage in diverse areas such as web sea...
Ride-sharing is an essential aspect of modern urban mobility. In this pa...
Graph compression or sparsification is a basic information-theoretic and...
In this paper, we initiate the study of fair clustering that ensures
dis...
Given a graph G=(V,E), capacities w(e) on edges, and a subset of
termina...
Given a graph G=(V,E) with non-negative real edge lengths and an integer...
In the Group Steiner Tree problem (GST), we are given a (vertex or
edge)...