Hochschulschrift
Exact algorithms for NP hard problems on networks : design, analysis, and implementation
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
IV, III, 171 S.
- Sprache
-
Englisch
- Anmerkungen
-
Ill., graph. Darst.
Tübingen, Univ., Diss., 2003 (Nicht für den Austausch)
- Schlagwort
-
Netzwerk
Optimierungsproblem
NP-vollständiges Problem
Effizienter Algorithmus
Algorithmen ; (planare) Graphen ; NP-harte Probleme
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:11 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
Ähnliche Objekte (12)
NP-hard networking problems : exact and approximate algorithms
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Parameterized algorithms of fundamental NP-hard problems: a survey
Exact algorithms based on specific complexity measures for hard problems
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Exact exponential algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Pool resolution is NP-hard to recognize
NP-hard networking problems : exact and approximate algorithms
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Parameterized algorithms of fundamental NP-hard problems: a survey
Exact algorithms based on specific complexity measures for hard problems
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Exact exponential algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Pool resolution is NP-hard to recognize
NP-hard networking problems : exact and approximate algorithms
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Parameterized algorithms of fundamental NP-hard problems: a survey
Exact algorithms based on specific complexity measures for hard problems
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
Exact exponential algorithms
Automating Resolution is NP-Hard
Graph algorithms and NP-completeness
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms