Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Tav
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
9
votes
Prove that the 2-approximation of a modified local search algorithm for max-cut is tight
algorithms
algorithm-analysis
np-complete
approximation
max-cut
asked Dec 20, 2019 at 22:04
cs.stackexchange.com
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled
cs.stackexchange.com