scientific article; zbMATH DE number 1759471
From MaRDI portal
Publication:4536425
zbMath1010.90523MaRDI QIDQ4536425
Sounaka Mishra, Kripasindhu Sikdar
Publication date: 25 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsNP-optimization problemshardness of approximationAPX-hardnessL-reductionminimaximal and maximinimal NP-optimization problem
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: