1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2024
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
Haoyan Shi, Sanjay Mehrotra
Goemans and Williamson proposed a randomized rounding algorithm for the MAX-CUT problem with a 0.878 approximation bound in expectation. The 0.878 approximation bound remains the b…
math.OC2023★ 1 cited
Optimizing Equitable Resource Allocation in Parallel Any-Scale Queues with Service Abandonment and its Application to Liver Transplant
Shukai Li, Sanjay Mehrotra
We study the problem of equitably and efficiently allocating an arriving resource to multiple queues with customer abandonment. The problem is motivated by the cadaveric liver allo…