Pages that link to "Item:Q3150283"
From MaRDI portal
The following pages link to Improved approximation of Max-Cut on graphs of bounded degree (Q3150283):
Displaying 9 items.
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Sparse graphs: Metrics and random models (Q5198669) (← links)
