2 citations · 2 across the 2 of their papers we have counts for
3 papers · 1 filter
Universal Algorithms for Clustering Problems
Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi
This paper presents universal algorithms for clustering problems, including the widely studied -median, -means, and -center objectives. The input is a metric space contain…
Robust Algorithms for TSP and Steiner Tree
Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi
Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the e…
Retracting Graphs to Cycles
Samuel Haney, Mehraneh Liaee, Bruce M. Maggs +3
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum…