28 citations · 73 across the 23 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
Greedy Algorithms for Steiner Forest
Anupam Gupta, Amit Kumar
In the Steiner Forest problem, we are given terminal pairs , and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agraw…
cs.DS2014
Rejecting Jobs to Minimize Load and Maximum Flow-time
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg +1
Online algorithms are usually analyzed using the notion of competitive ratio which compares the solution obtained by the algorithm to that obtained by an online adversary for the w…
cs.DS2014
Sampling in Space Restricted Settings
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal +1
Space efficient algorithms play a central role in dealing with large amount of data. In such settings, one would like to analyse the large data using small amount of "working space…