Logarithmic inapproximability results for the minimum shortest path routing conflict problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Logarithmic inapproximability results for the minimum shortest path routing conflict problem ; 2009, 25
Preprint Reihe Mathematik ; 2009, 25
- Classification
-
Mathematik
- Creator
-
Bley, Andreas
- DOI
-
10.14279/depositonce-14429
- Handle
-
11303/15656
- URN
-
urn:nbn:de:101:1-2021122201415899517840
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
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.
Associated
- Bley, Andreas
Other Objects (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