scientific article; zbMATH DE number 1304324
From MaRDI portal
Publication:4251055
zbMath0927.68059MaRDI QIDQ4251055
Publication date: 28 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Is constraint satisfaction over two variables always easy? ⋮ An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding ⋮ On semidefinite programming relaxations of maximum \(k\)-section ⋮ An approximation algorithm for maxk-uncut with capacity constraints ⋮ A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section ⋮ The capacitated max \(k\)-cut problem ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance ⋮ Relaxations of Combinatorial Problems Via Association Schemes
This page was built for publication:
