scientific article; zbMATH DE number 1839429

zbMath1003.90055MaRDI QIDQ4782694

Marek Karpinski

Publication date: 2 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380024

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

zbMATH Keywords

computational complexitybounded degree combinatorial optimizationexplicit nonapproximability bounds

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Maximum-cover source location problems with objective edge-connectivity three ⋮ Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies ⋮ On the approximability of Dodgson and Young elections

This page was built for publication: