Dealing with hard problems Lecture notes on approximation algorithms and randomized algorithms

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

Dyer, Martin E.
Jerrum, Mark
Karpinski, Marek

January 2008

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approx...

Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques

Teo, Chungpiaw

January 1996

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.Includes bi...

Resolution of NP-complete problems

Gavaldà Mestre, Ricard

June 1995

These are the course notes for my lectures on "Resolution of NP-complete problems". These lectures a...

Dealing with hard problems: (lecture notes on approximation algorithms and randomized algorithms)

Chvatal, Vasek

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)

Dyer, Martin
Feige, Uriel
Frieze, Alan M.
Karpinski, Marek

January 2011

The Dagstuhl Seminar on ``Design and Analysis of Randomized and Approximation Algorithms\u27\u27 (Se...

09511 Open Problems -- Parameterized complexity and approximation algorithms

Demaine, Erik D.
Hajiaghayi, MohammadTaghi

January 2010

The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem...

09511 Open Problems -- Parameterized complexity and approximation algorithms

Demaine, Erik D.
Hajiaghayi, MohammadTaghi

January 2010

The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem...

New approximation algorithms for some dynamic storage allocation problems

Li, S.C.
Leong, H.W.
Quek, S.K.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Ein neuartiger Algorithmus zur Approximation bandbegrenzter Funktionen und ihrer Hilbert-Transformierten

Boche, H.
Protzmann, M.
Technische Univ. Dresden (Germany). Sonderforschungsbereich 358 - Automatisierter Systementwurf, Synthese, Test, Verifikation dedizierte Anwendungen

January 1995

Available from TIB Hannover: RR 7267(95,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Techni...

Approximation algorithms for information dissemination problems

Fraigniaud, Pierre
Vial, Sandrine
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Lyon-1 Univ., 69 (France). Lab. de l'Informatique du Parallelisme

January 1995

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 13902 / INIST-CNRS - ...

The Design of Approximation Algorithms

Williamson, David P
Shmoys, David B

January 2011

Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms t...

Hardness of Approximation (Invited Talk)

Khot, Subhash

January 2016

The talk will present connections between approximability of NP-complete problems, analysis, and geo...

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

Demange, Marc
Paschos, Vangelis

January 2002

Cet article est le premier d'une série de deux articles où nous présentons les principales caractéri...

Approximation Algorithms for Combinatorial Optimization

Carlos A. S. Oliveira

January 2004

In combinatorial optimization, the most important challenges are presented by problems belonging to ...

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

Dyer, Martin E.
Jerrum, Mark
Karpinski, Marek

January 2008

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approx...

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

Dyer, Martin E.
Jerrum, Mark
Karpinski, Marek

January 2008

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approx...

Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques

Teo, Chungpiaw

January 1996

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.Includes bi...

Resolution of NP-complete problems

Gavaldà Mestre, Ricard

June 1995

These are the course notes for my lectures on "Resolution of NP-complete problems". These lectures a...

Dealing with hard problems: (lecture notes on approximation algorithms and randomized algorithms)

Chvatal, Vasek

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)

Dyer, Martin
Feige, Uriel
Frieze, Alan M.
Karpinski, Marek

January 2011

The Dagstuhl Seminar on ``Design and Analysis of Randomized and Approximation Algorithms\u27\u27 (Se...

09511 Open Problems -- Parameterized complexity and approximation algorithms

Demaine, Erik D.
Hajiaghayi, MohammadTaghi

January 2010

The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem...

09511 Open Problems -- Parameterized complexity and approximation algorithms

Demaine, Erik D.
Hajiaghayi, MohammadTaghi

January 2010

The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem...

New approximation algorithms for some dynamic storage allocation problems

Li, S.C.
Leong, H.W.
Quek, S.K.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Ein neuartiger Algorithmus zur Approximation bandbegrenzter Funktionen und ihrer Hilbert-Transformierten

Boche, H.
Protzmann, M.
Technische Univ. Dresden (Germany). Sonderforschungsbereich 358 - Automatisierter Systementwurf, Synthese, Test, Verifikation dedizierte Anwendungen

January 1995

Available from TIB Hannover: RR 7267(95,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Techni...

Approximation algorithms for information dissemination problems

Fraigniaud, Pierre
Vial, Sandrine
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Lyon-1 Univ., 69 (France). Lab. de l'Informatique du Parallelisme

January 1995

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 13902 / INIST-CNRS - ...

The Design of Approximation Algorithms

Williamson, David P
Shmoys, David B

January 2011

Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms t...

Hardness of Approximation (Invited Talk)

Khot, Subhash

January 2016

The talk will present connections between approximability of NP-complete problems, analysis, and geo...

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

Demange, Marc
Paschos, Vangelis

January 2002

Cet article est le premier d'une série de deux articles où nous présentons les principales caractéri...

Approximation Algorithms for Combinatorial Optimization

Carlos A. S. Oliveira

January 2004

In combinatorial optimization, the most important challenges are presented by problems belonging to ...

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

Dyer, Martin E.
Jerrum, Mark
Karpinski, Marek

January 2008

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approx...

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

Dyer, Martin E.
Jerrum, Mark
Karpinski, Marek

January 2008

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approx...

Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques

Teo, Chungpiaw

January 1996

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.Includes bi...

Resolution of NP-complete problems

Gavaldà Mestre, Ricard

June 1995

These are the course notes for my lectures on "Resolution of NP-complete problems". These lectures a...

Dealing with hard problems Lecture notes on approximation algorithms and randomized algorithms

Abstract

Extracted data

Dealing with hard problems Lecture notes on approximation algorithms and randomized algorithms

Abstract

Extracted data

Related items

Related items