6 citations · 19 across the 5 of their papers we have counts for
5 papers
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
Sara Ahmadian, Chaitanya Swamy
We consider clustering problems with {\em non-uniform lower bounds and outliers}, and obtain the {\em first approximation guarantees} for these problems. We have a set $\F$ of faci…
Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems
Ian Post, Chaitanya Swamy
We consider various {\em multi-vehicle versions of the minimum latency problem}. There is a fleet of vehicles located at one or more depot nodes, and we seek a collection of ro…
Improved Region-Growing and Combinatorial Algorithms for -Route Cut Problems
Guru Guruganesh, Laura Sanita, Chaitanya Swamy
We study the {\em -route} generalizations of various cut problems, the most general of which is \emph{-route multicut} (-MC) problem, wherein we have source-sink pairs…
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions
Umang Bhaskar, Katrina Ligett, Leonard J. Schulman +1
The analysis of network routing games typically assumes, right at the onset, precise and detailed information about the latency functions. Such information may, however, be unavail…
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
Deeparnab Chakrabarty, Chaitanya Swamy
We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients…