Hochschulschrift | Online-Publikation
Exact algorithms for NP hard problems on networks : design, analysis and implementation
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Language
-
Englisch
- Notes
-
Erscheinungsjahr an der Haupttitelstelle: 2002
Tübingen, Univ., Diss., 2003
- Keyword
-
Netzwerk
Optimierungsproblem
NP-vollständiges Problem
Effizienter Algorithmus
Algorithmen ; (planare) Graphen ; NP-harte Probleme
- Creator
- URN
-
urn:nbn:de:bsz:21-opus-6826
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:51 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.
Object type
- Hochschulschrift
- Online-Publikation
Associated
Other Objects (12)
Exact algorithms for NP hard problems on networks : design, analysis, and implementation
NP-hard networking problems : exact and approximate algorithms
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Exact algorithms based on specific complexity measures for hard problems
Exact exponential algorithms
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Exact algorithms for constraint satisfaction problems
Robust Geometric Programming is co-NP hard
Exact algorithms for NP hard problems on networks : design, analysis, and implementation
NP-hard networking problems : exact and approximate algorithms
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Exact algorithms based on specific complexity measures for hard problems
Exact exponential algorithms
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Exact algorithms for constraint satisfaction problems
Robust Geometric Programming is co-NP hard
Exact algorithms for NP hard problems on networks : design, analysis, and implementation
NP-hard networking problems : exact and approximate algorithms
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Exact algorithms based on specific complexity measures for hard problems
Exact exponential algorithms
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Exact algorithms for constraint satisfaction problems