PaperMetrixEvidence-aware discovery
EN
Interface language English EN العربية AR Türkçe TR
Create account
Researcher profile

Sanjay Mehrotra

1 paper in the PaperMetrix corpus

Publications

Papers by this author

  1. On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms

    2024 · arXiv (Cornell University)

    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 best-known approximation bound for this APX-hard problem. Their approach was …