Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Reihe CI ; 211-06
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2006
- Urheber
-
Storch, Tobias
- Handle
-
2003/26119
- URN
-
urn:nbn:de:101:1-20160613908
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Storch, Tobias
- Universitätsbibliothek Dortmund
Entstanden
- 2006
Ähnliche Objekte (12)
Random combinatorial structures and randomized search heuristics
Sparse random models in combinatorics
Random perturbation of sparse graphs
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Strong Refutation Heuristics for Random k-SAT
Finding Reusable Modules Using Sparse Matrix Decompositions
The rank of sparse random matrices
Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics
Randomized search heuristics as an alternative to exact optimization
Random combinatorial structures and randomized search heuristics
Sparse random models in combinatorics
Random perturbation of sparse graphs
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Strong Refutation Heuristics for Random k-SAT
Finding Reusable Modules Using Sparse Matrix Decompositions
The rank of sparse random matrices
Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics
Randomized search heuristics as an alternative to exact optimization
Random combinatorial structures and randomized search heuristics
Sparse random models in combinatorics
Random perturbation of sparse graphs
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Strong Refutation Heuristics for Random k-SAT
Finding Reusable Modules Using Sparse Matrix Decompositions
The rank of sparse random matrices
Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics