scientific article; zbMATH DE number 1754595
From MaRDI portal
Publication:4535020
zbMath0986.90041MaRDI QIDQ4535020
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760213
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Bounds on the max and min bisection of random cubic and random 4-regular graphs ⋮ A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems ⋮ Complexity of approximating CSP with balance/hard constraints ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ Sherali-adams strikes back ⋮ Improved approximation algorithms for maximum graph partitioning problems
This page was built for publication:
