Sciweavers

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

4

ORL
2006

favoriteEmaildiscussreport

60views more ORL 2006»

Finding the K shortest hyperpaths using reoptimization

13 years 4 months ago

Finding the K shortest hyperpaths using reoptimization

Download www.hha.dk

Lars Relund Nielsen, Daniele Pretolani, Kim Allan

Real-time Traffic

ORL 2006 |

claim paper

Related Content

» Surface kNN Query Processing

» Computing homotopic shortest paths efficiently

» Synthesizing Shortest Linear StraightLine Programs over GF2 Using SAT

» Monitoring path nearest neighbor in road networks

» Optimal lower bounds for the KorkineZolotareff parameters of a lattice and for Schnorrs al...

» Scalable network distance browsing in spatial databases

» An approximation algorithm for sorting by reversals and transpositions

» Accomplishing Approximate FCFS Fairness Without Queues

» The Efficiency of Resolution and DavisPutnam Procedures

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	ORL
Authors	Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen

Comments (0)