Pages that link to "Item:Q4575855"
From MaRDI portal
The following pages link to (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space (Q4575855):
Displaying 8 items.
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)