Sciweavers

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

44

FOCS
2010
IEEE

favoriteEmaildiscussreport

152views Theoretical Computer Science» more FOCS 2010»

Replacement Paths via Fast Matrix Multiplication

13 years 8 months ago

Replacement Paths via Fast Matrix Multiplication

Download www.wisdom.weizmann.ac.il

Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t path that avoids e. Apart from approximation algorithms and algorithms for special graph classes, the naive solution to this problem

Oren Weimann, Raphael Yuster

Real-time Traffic

FOCS 2010 | Matrix Multiplication | Shortest Paths | Shortest S-to-t Path | Theoretical Computer Science |

claim paper

Related Content

» Fast Estimation of Diameter and Shortest Paths without Matrix Multiplication

» Perfect Path Phylogeny Haplotyping with Missing Data Is FixedParameter Tractable

» Inversion of Analytic Functions via Canonical Polynomials A Matrix Approach

» Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution

» Compressed Modular Matrix Multiplication

» NBit Unsigned Division via NBit MultiplyAdd

» Fast algorithms for discrete polynomial transforms

» KdJump a PathPreserving Stackless Traversal for Faster Isosurface Raytracing on GPUs

» Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Process...

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Oren Weimann, Raphael Yuster

Comments (0)