Logarithmic inapproximability results for the minimum shortest path routing conflict problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Logarithmic inapproximability results for the minimum shortest path routing conflict problem ; 2009, 25
Preprint Reihe Mathematik ; 2009, 25
- Klassifikation
-
Mathematik
- Urheber
-
Bley, Andreas
- DOI
-
10.14279/depositonce-14429
- Handle
-
11303/15656
- URN
-
urn:nbn:de:101:1-2021122201415899517840
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 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.
Beteiligte
- Bley, Andreas
Ähnliche Objekte (12)
Near-shortest path routing in hybrid communication networks
An origin-based model for unique shortest path routing
Shortest path in the database and more with pgRouting
An enhanced Benders decomposition method for unique shortest path routing
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Path search in your Database and more with pgRouting
Shortest Path search in your Database and more with pgRouting
Faster goal-oriented shortest path search for bulk and incremental detailed routing
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Near-shortest path routing in hybrid communication networks
An origin-based model for unique shortest path routing
Shortest path in the database and more with pgRouting
An enhanced Benders decomposition method for unique shortest path routing
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Path search in your Database and more with pgRouting
Shortest Path search in your Database and more with pgRouting
Faster goal-oriented shortest path search for bulk and incremental detailed routing
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Near-shortest path routing in hybrid communication networks
An origin-based model for unique shortest path routing
Shortest path in the database and more with pgRouting
An enhanced Benders decomposition method for unique shortest path routing
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Path search in your Database and more with pgRouting
Shortest Path search in your Database and more with pgRouting
Faster goal-oriented shortest path search for bulk and incremental detailed routing
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms