Search Results - RERO DOC

Approximation algorithms for survivable network design

Jabal Ameli, Afrouz ; Grandoni, Fabrizio (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2021 ; 2021INFO005.

Many relevant discrete optimization problems are believed to be hard to solve efficiently (i.e. they cannot be solved in polynomial time unless P=NP). An approximation algorithm is one of the ways to tackle these hard optimization problems. These algorithms have polynomial running time and compute a feasible solution whose value is within a proven factor (approximation factor) of the optimal...

OPEN IN
SONAR

Approximation algorithms for two-dimensional geometric packing problems

Gálvez, Waldo ; Grandoni, Fabrizio (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO013.

There are a lot of natural problems arising in real life that can be modeled as discrete optimization problems. Unfortunately many of them are believed to be hard to solve efficiently (i.e. they cannot be solved in polynomial time unless P=NP). An approximation algorithm is one of the ways to tackle these hard optimization problems. These algorithms have polynomial running time and guarantee a...

Refine my results

Document type

Institution

Specific Collection

Language

Author