Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

IFIP
2007
Springer

103views Programming Languages» more IFIP 2007»

Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem

16 years 5 days ago

Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem

Download ifip2007.agh.edu.pl

Jacek Czekaj, Leslaw Socha

Real-time Traffic

Communications | IFIP 2007 |

claim paper

Related Content

» Stochastic Shortest Paths Via Quasiconvex Maximization

» A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes

» New dynamic programming algorithms for the resource constrained elementary shortest path p...

» Resource Constrained Shortest Paths

» Fast shortest path distance estimation in large networks

» Computing shortest paths with uncertainty

» The Shortcut Problem Complexity and Approximation

» Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs

» On the Ksimple shortest paths problem in weighted directed graphs

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	IFIP
Authors	Jacek Czekaj, Leslaw Socha

Comments (0)