Pages that link to "Item:Q2467485"
From MaRDI portal
The following pages link to An exact algorithm for MAX-CUT in sparse graphs (Q2467485):
Displaying 12 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
