Search alternatives:
shortcut » shortcuts
shortest » shorter
shortests » shorters, hortests, shortess, shortlists
Cover Image
Read Now

1
by Li, Fajie, Klette, Reinhard
Published 2011
Springer London
Table of Contents: “...Part I: Discrete or Continuous Shortest Paths -- Euclidean Shortest Paths -- Deltas and Epsilons...”
Cover Image
Read Now

2
by Ramalingam, G.
Published 1996
Springer Berlin Heidelberg
Table of Contents: “... algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental...”
Cover Image
Read Now

3
Published 2012
Springer Berlin Heidelberg
Table of Contents: “... Memory -- Shortest-Elapsed-Time-First on a Multiprocessor Efficient Route Compression for Hybrid Route...”
Cover Image
Read Now

4
Published 1985
Springer Berlin Heidelberg
Table of Contents: “... -- A single source shortest path algorithm for a planar distributed network -- An algorithm for two...”
Cover Image
Read Now

5
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers...”
Cover Image
Read Now

6
Published 2015
Springer International Publishing
Table of Contents: “... in Road Networks -- SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks...”
Cover Image
Read Now

7
Published 2004
Springer Berlin Heidelberg
Table of Contents: “...Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic...”
Cover Image
Read Now

8
Published 2005
Springer Berlin Heidelberg
Table of Contents: “...-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted...”
Cover Image
Read Now

9
Published 2010
Springer Berlin Heidelberg
Table of Contents: “... Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems...”
Cover Image
Read Now

10
Published 2017
Springer International Publishing
Table of Contents: “... for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair...”
Cover Image
Read Now

11
Published 2005
Springer Berlin Heidelberg
Table of Contents: “... -- Inferring AS Relationships: Dead End or Lively Beginning? -- Acceleration of Shortest Path and Constrained...”
Cover Image
Read Now

12
Published 2015
Springer International Publishing
Table of Contents: “... Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees...”
Cover Image
Read Now

13
Published 2021
Springer International Publishing
Table of Contents: “... shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG...”
Cover Image
Read Now

14
Published 2020
Springer International Publishing
Table of Contents: “... Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing...”
Cover Image
Read Now

15
Published 2019
Springer International Publishing
Table of Contents: “... of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing...”
Cover Image
Read Now

16
Published 2015
Springer International Publishing
Table of Contents: “... for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inflexible Edges -- Linear time Constructions...”
Cover Image
Read Now

17
Published 2016
Springer International Publishing
Table of Contents: “... Problem -- Optimal Upgrading Schemes for Eective Shortest Paths in Networks...”
Cover Image
Read Now

18
Published 2010
Springer Berlin Heidelberg
Table of Contents: “... for a Shortest Path in a Simple Polygon -- Approximation Algorithms for Art Gallery Problems in Polygons...”
Cover Image
Read Now

19
by Michalewicz, Zbigniew, Fogel, David B.
Published 2000
Springer Berlin Heidelberg
Table of Contents: “... of These Things Is Not Like the Others -- 7 Designing Evolutionary Algorithms -- VIII What Is the Shortest Way...”
Cover Image
Read Now

20
Published 2019
Springer International Publishing
Table of Contents: “... -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power...”