Santhoshini Velusamy

activity

20202026

most citedFair allocation of a multiset of indivisible items

14 citations · 27 across the 20 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Streaming Algorithms via Local Algorithms for Maximum Directed Cut

Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan +1

We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder et al…

cs.DS2024

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds

Samuel Hwang, Noah G. Singer, Santhoshini Velusamy

In the maximum directed cut problem, the input is a directed graph $G = (V, E)$ , and the goal is to pick a partition $V = S \cup (V ∖ S)$ of the vertices such that as many edg…