scientific article

zbMath1135.90420MaRDI QIDQ3499508

Alan M. Frieze, Mark R. Jerrum

Publication date: 2 June 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items

SDP-based bounds for graph partition via extended ADMM, Approximation algorithm for MAX DICUT with given sizes of parts, Sharp spectral bounds of several graph parameters using eigenvector norms, Approximate Max \(k\)-Cut with subgraph guarantee, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, Complexity of approximating CSP with balance/hard constraints, The Maximum k-Colorable Subgraph Problem and Related Problems, Unnamed Item, Constrained Submodular Maximization via a Nonsymmetric Technique, Energy efficient monitoring in sensor networks, A representation theory perspective on simultaneous alignment and classification, A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section, Laplacian eigenvalues and fixed size multisection, Three candidate plurality is stablest for small correlations, Cone-LP's and semidefinite programs: Geometry and a simplex-type method, Maximally stable Gaussian partitions with discrete applications, A new Lagrangian net algorithm for solving max-bisection problems, A multiple penalty function method for solving max-bisection problems, Semi-Definite positive Programming Relaxations for Graph K_n-Coloring in Frequency Assignment, Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring, Approximation algorithms for MAX RES CUT with limited unbalanced constraints, Energy Efficient Monitoring in Sensor Networks, Realignment in the National Football League: Did they do it right?, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints, Spectral partitioning with multiple eigenvectors, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Clustering with qualitative information, Unnamed Item, Mixed linear and semidefinite programming for combinatorial and quadratic optimization