scientific article; zbMATH DE number 2077131

zbMath1044.68942MaRDI QIDQ4470516

Pierluigi Crescenzi, Luca Trevisan

Publication date: 1 July 2004

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (10)

Genetic local search and hardness of approximation for the server load balancing problem ⋮ Structure in approximation classes ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ Max NP-completeness made easy ⋮ Improved non-approximability results for minimum vertex cover with density constraints ⋮ Approximate solution of NP optimization problems ⋮ Local search, reducibility and approximability of NP-optimization problems ⋮ Structural properties of bounded relations with an application to NP optimization problems ⋮ On weighted vs unweighted versions of combinatorial optimization problems ⋮ Bounded queries, approximations, and the Boolean hierarchy

This page was built for publication: