24 citations · 44 across the 18 of their papers we have counts for
4 papers · 1 filter
On Strong Graph Partitions and Universal Steiner Trees
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan +2
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph and a root node , we seek a single spanning tree of minimum {\em stretc…
Oblivious Buy-at-Bulk in Planar Graphs
Srivathsan Srinivasagopalan, Costas Busch, S. S. Iyengar
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destinations in the graph, such that any set of…
An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
Srivathsan Srinivasagopalan, Costas Busch, S. S. Iyengar
We consider the problem of constructing a single spanning tree for the single-source buy-at-bulk network design problem for doubling-dimension graphs. We compute a spanning tree to…
A Streaming Approximation Algorithm for Klee's Measure Problem
Gokarna Sharma, Costas Busch, Srikanta Tirthapura
The efficient estimation of frequency moments of a data stream in one-pass using limited space and time per item is one of the most fundamental problem in data stream processing. A…