10 citations · 17 across the 2 of their papers we have counts for
3 papers
Online and Offline Greedy Algorithms for Routing with Switching Costs
Roy Schwartz, Mohit Singh, Sina Yazdanbod
Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between…
On the Approximation of Submodular Functions
Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz +2
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses…
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain +1
We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like several existing algorithms, it achieves approximatio…