Editing Open Problems:67
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
{{Header | {{Header | ||
+ | |title=Difficult Instance for Max-Cut in the Streaming Model | ||
|source=bertinoro14 | |source=bertinoro14 | ||
|who=Robert Krauthgamer | |who=Robert Krauthgamer | ||
}} | }} | ||
+ | |||
We are interested in '''Max-Cut''' in the streaming model, and specifically in the tradeoff between approximation and space (storage) complexity. | We are interested in '''Max-Cut''' in the streaming model, and specifically in the tradeoff between approximation and space (storage) complexity. | ||
Formally, in the '''Max-Cut''' problem, the input is a graph $G$, and the goal is to compute the maximum number of edges that cross any single cut $(V_1,V_2)$. This is clearly equivalent to computing the least number of edges that need to be removed to make the graph bipartite. | Formally, in the '''Max-Cut''' problem, the input is a graph $G$, and the goal is to compute the maximum number of edges that cross any single cut $(V_1,V_2)$. This is clearly equivalent to computing the least number of edges that need to be removed to make the graph bipartite. |