Pages that link to "Item:Q5363106"
From MaRDI portal
The following pages link to Streaming Lower Bounds for Approximating MAX-CUT (Q5363106):
Displaying 13 items.
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- (Q3174917) (← links)
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space (Q4575855) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5757091) (← links)
- (Q5875456) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)