- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Konstanz, Universität Konstanz, Dissertation, 2022
- Schlagwort
-
Algorithmus
Kombinatorische Optimierung
Kürzester-Weg-Problem
Graph
NP-hartes Problem
Graphenzeichnen
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
KOPS Universität Konstanz
- (wann)
-
2022
- Urheber
-
Beck, Moritz
- URN
-
urn:nbn:de:bsz:352-2-109cjzlrh54eg3
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 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
- Beck, Moritz
- KOPS Universität Konstanz
Entstanden
- 2022
Ähnliche Objekte (12)
Automating Resolution is NP-Hard
Conceptual structures: leveraging semantic technologies : proceedings
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
On the benefits of using NP-hard problems in Branch & Bound
A polynomial algorithm for a NP-hard to solve optimization problem
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Automating Resolution is NP-Hard
Conceptual structures: leveraging semantic technologies : proceedings
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
On the benefits of using NP-hard problems in Branch & Bound
A polynomial algorithm for a NP-hard to solve optimization problem
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Automating Resolution is NP-Hard
Conceptual structures: leveraging semantic technologies : proceedings
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
On the benefits of using NP-hard problems in Branch & Bound
A polynomial algorithm for a NP-hard to solve optimization problem
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard