P. Crescenzi

Publications186
h-index33
Citations6,870
Highly Influential Citations447
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Andrea Marino
  • 85 Publications • 1,116 Citations
  • C. Papadimitriou
  • 560 Publications • 61,345 Citations
  • Michele Borassi
  • 19 Publications • 385 Citations
  • Henning Meyerhenke
  • 126 Publications • 2,918 Citations
  • Publications
  • Influence
Complexity and approximation: combinatorial optimization problems and their approximability properties
Complexity and Approximation
A compendium of NP optimization problems
TLDR
This compendium of approximability results of NP-hard optimization problems has been collected together and is interested in studying a class of optimization problems whose feasible solutions are short and easy-to-recognize.
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
TLDR
This work proves that MECBS is not approximable within a sub-logarithmic factor (unless P=NP), and proposes a polynomial-time approximation algorithm for the NP-hard case in which both the dimension and the gradient are equal to 2.
Introduction to the theory of complexity
TLDR
1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.
On the Complexity of Protein Folding
We show that the protein folding problem in the two-dimensional H-P model is NP-complete.
MeDuSa: a multi-draft based scaffolder
TLDR
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.
Structure in Approximation Classes
TLDR
After defining a new approximation preserving reducibility to be used for as many approximation classes as possible, this paper gives the first examples of natural NPO-complete problems and the firstExamples of natural APX-intermediate problems.
A Uniform Approach to Define Complexity Classes
Completeness in Approximation Classes
TLDR
It is shown that the degree structure of NPO allows intermediate degrees, that is, if P≠NP, there are problems which are neither complete nor belong to a lower class, and natural approximation preserving reductions are defined.
...
1
2
3
4
5
...