7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DS2017
Balanced Stable Marriage: How Close is Close Enough?
Sushmita Gupta, Sanjukta Roy, Saket Saurabh +1
The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that…
cs.DS2017★ 7 cited
On Treewidth and Stable Marriage
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SE…