Approximability of hard combinatorial optimization problems: an introduction

DOI10.1023/A:1018987015651zbMath0997.90069MaRDI QIDQ1593534

Francesco Maffioli, Giulia Galbiati

Publication date: 17 January 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

NP-completenesscombinatorial optimization problemsintroductory surveycharacterization of approximation classes

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Set covering approach for reconstruction of sibling relationships

This page was built for publication: Approximability of hard combinatorial optimization problems: an introduction