1 citations · 2 across the 4 of their papers we have counts for
4 papers
Improvable Knapsack Problems
Marc Goerigk, Yogish Sabharwal, Anita Schöbel +1
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Whic…
Approximation Algorithms for Budget Constrained Network Upgradeable Problems
Debjyoti Saharoy, Sandeep Sen
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph where the weight an edge can be upgraded for a cost $c(…
Improved Randomized Rounding using Random Walks
Sandeep Sen
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in . Starting from an optimal fractional feasible soluti…
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma, Sandeep Sen
In this paper we present randomized algorithms for sorting and convex hull that achieves optimal performance (for speed-up and cache misses) on the multicore model with private cac…