- Sprache
-
Englisch
- Identifier
-
1297789873
Thema
Kürzester-Weg-Problem; Berechnungskomplexität; Algorithmus; NP-hartes Problem; Parametrisierte Komplexität; Effizienter Algorithmus
Beteiligte Personen und Organisationen
- DOI
-
10.18452/26639
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
27.09.2023, 09:58 MESZ
Objekttyp
- Monografie
Beteiligte
- Nelles, Florian
- Kratsch, Stefan
- Friedrich, Tobias
- Kreutzer, Stephan
Ähnliche Objekte (12)
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Design and analysis of sequential and parallel single-source shortest paths algorithms
Network-Design Problems in Graphs and on the Plane
Stable matchings beyond stable marriage: models, algorithms, complexity
Algorithms for sparse convolution and sublinear edit distance
Competitive and voting location
Network-design problems in graphs and on the plane
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithms for the Steiner problem in networks
Efficient algorithms for production scheduling
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Design and analysis of sequential and parallel single-source shortest paths algorithms
Network-Design Problems in Graphs and on the Plane
Stable matchings beyond stable marriage: models, algorithms, complexity
Algorithms for sparse convolution and sublinear edit distance
Competitive and voting location
Network-design problems in graphs and on the plane
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithms for the Steiner problem in networks
Efficient algorithms for production scheduling
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Design and analysis of sequential and parallel single-source shortest paths algorithms
Network-Design Problems in Graphs and on the Plane
Stable matchings beyond stable marriage: models, algorithms, complexity
Algorithms for sparse convolution and sublinear edit distance
Competitive and voting location
Network-design problems in graphs and on the plane
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithms for the Steiner problem in networks