Monografie
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2004
- Identifier
-
972316930
Thema
Kürzester-Weg-Problem ; Matching-Problem ; Dijkstra-Algorithmus ; Heuristik ; Average-case-Komplexität ; Online-Algorithmus ; Competitive analysis ; Smoothed Complexity ; Kürzester-Weg-Problem; Kombinatorische Optimierung; Hochschulschrift; Online-Publikation
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Design and analysis of sequential and parallel single-source shortest paths algorithms
Sequential matching problem
Algorithms for the Steiner problem in networks
Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies
Curve reconstruction and the traveling salesman problem
Online problems and two-player games : algorithms and analysis
Average-case complexity of shortest-paths problems
Online-Planungsprobleme mit Fristen : Algorithmendesign und Analysen
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Evolutionäre Verfahren zur Optimierung von Produktionsplänen mittels impliziter Kooperation
Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics
Solving large scale crew pairing problems
Design and analysis of sequential and parallel single-source shortest paths algorithms
Sequential matching problem
Algorithms for the Steiner problem in networks
Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies
Curve reconstruction and the traveling salesman problem
Online problems and two-player games : algorithms and analysis
Average-case complexity of shortest-paths problems
Online-Planungsprobleme mit Fristen : Algorithmendesign und Analysen
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Evolutionäre Verfahren zur Optimierung von Produktionsplänen mittels impliziter Kooperation
Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics
Solving large scale crew pairing problems
Design and analysis of sequential and parallel single-source shortest paths algorithms
Sequential matching problem
Algorithms for the Steiner problem in networks
Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies
Curve reconstruction and the traveling salesman problem
Online problems and two-player games : algorithms and analysis
Average-case complexity of shortest-paths problems
Online-Planungsprobleme mit Fristen : Algorithmendesign und Analysen
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Evolutionäre Verfahren zur Optimierung von Produktionsplänen mittels impliziter Kooperation
Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics