Design and analysis of randomized and approximation algorithms : 05201 abstracts collection ; Dagstuhl seminar
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
[Wadern]
- (who)
-
[Internat. Begegnungs- und Forschungszentrum für Informatik]
- (when)
-
[2005]
- Contributor
- URN
-
urn:nbn:de:0030-drops-3191
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:55 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Dyer, Martin
- Jerrum, Mark
- Karpinski, Marek
- [Internat. Begegnungs- und Forschungszentrum für Informatik]
Time of origin
- [2005]
Other Objects (12)
Randomized algorithms : approximation, generation and counting
Randomized Algorithms for High-Dimensional Integration and Approximation
Randomized Approximation and Online Algorithms for Assignment Problems
Randomized approximation for the matching and vertex cover problem in hypergraphs : complexity and algorithms
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Approximation algorithms and semidefinite programming
Stochastic approximation algorithms and applications
Approximation algorithms
Approximation Algorithms
Stochastic approximation and recursive algorithms and applications
Approximation and learning by greedy algorithms
Approximation and online algorithms in scheduling and coloring
Randomized algorithms : approximation, generation and counting
Randomized Algorithms for High-Dimensional Integration and Approximation
Randomized Approximation and Online Algorithms for Assignment Problems
Randomized approximation for the matching and vertex cover problem in hypergraphs : complexity and algorithms
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Approximation algorithms and semidefinite programming
Stochastic approximation algorithms and applications
Approximation algorithms
Approximation Algorithms
Stochastic approximation and recursive algorithms and applications
Approximation and learning by greedy algorithms
Approximation and online algorithms in scheduling and coloring
Randomized algorithms : approximation, generation and counting
Randomized Algorithms for High-Dimensional Integration and Approximation
Randomized Approximation and Online Algorithms for Assignment Problems
Randomized approximation for the matching and vertex cover problem in hypergraphs : complexity and algorithms
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Approximation algorithms and semidefinite programming
Stochastic approximation algorithms and applications
Approximation algorithms
Approximation Algorithms
Stochastic approximation and recursive algorithms and applications
Approximation and learning by greedy algorithms