P
Pierluigi Crescenzi
Researcher at University of Florence
Publications - 146
Citations - 6548
Pierluigi Crescenzi is an academic researcher from University of Florence. The author has contributed to research in topics: Approximation algorithm & Optimization problem. The author has an hindex of 32, co-authored 139 publications receiving 6175 citations. Previous affiliations of Pierluigi Crescenzi include Sapienza University of Rome & University of Paris.
Papers
More filters
Book
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Giorgio Ausiello,Pierluigi Crescenzi,Giorgio Gambosi,Viggo Kann,Alberto Marchetti-Spaccamela,Marco Protasi +5 more
TL;DR: This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems.
BookDOI
Complexity and Approximation
Giorgio Ausiello,Alberto Marchetti-Spaccamela,Pierluigi Crescenzi,Giorgio Gambosi,Marco Protasi,Viggo Kann +5 more
Journal ArticleDOI
On the complexity of protein folding
Pierluigi Crescenzi,Deborah Goldman,Christos H. Papadimitriou,Antonio Piccolboni,Mihalis Yannakakis +4 more
TL;DR: It is shown that the protein folding problem in the two-dimensional H-P model is NP-complete.
Journal ArticleDOI
MeDuSa: a multi-draft based scaffolder
Emanuele Bosi,Beatrice Donati,Marco Galardini,Sara Brunetti,Marie-France Sagot,Pietro Liò,Pierluigi Crescenzi,Renato Fani,Marco Fondi +8 more
TL;DR: MeDuSa formalizes the scaffolding problem by means of a combinatorial optimization formulation on graphs and implements an efficient constant factor approximation algorithm to solve it, which does not require either prior knowledge on the microrganisms dataset under analysis or the availability of paired end read libraries.
Book
Introduction to the theory of complexity
TL;DR: 1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.