Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
IFIP
2007
Springer
favorite
Email
discuss
report
103
views
Programming Languages
»
more
IFIP 2007
»
Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
14 years 5 months ago
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
more »
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)
Researcher Info
Programming Languages Study Group
Computer Vision