scientific article; zbMATH DE number 1979498

zbMath1019.68136MaRDI QIDQ4425953

Markus Bläser, Bodo Manthey

Publication date: 14 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180187.htm

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Adding cardinality constraints to integer programs with applications to maximum satisfiability ⋮ Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder

This page was built for publication: