- Weitere Titel
-
Untere Schranken für heuristische Algorithmen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Techn. Hochsch., Dissertation, 2014
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2014
- Urheber
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:hbz:82-rwth-2015-004945
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:03 MESZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
- Berkholz, Christoph
- Grohe, Martin
- Otto, Martin
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2014
Ähnliche Objekte (12)
New algorithms and lower bounds for sequential access data compression
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Combinatorial heuristic algorithms with FORTRAN
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
New heuristic algorithms for the Dubins traveling salesman problem
New algorithms and lower bounds for sequential access data compression
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Combinatorial heuristic algorithms with FORTRAN
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
New heuristic algorithms for the Dubins traveling salesman problem
New algorithms and lower bounds for sequential access data compression
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Combinatorial heuristic algorithms with FORTRAN
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension