Sciweavers

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

15

COMPUTING
1998

favoriteEmaildiscussreport

50views more COMPUTING 1998»

Spanning Trees and Shortest Paths in Monge Graphs

13 years 10 months ago

Spanning Trees and Shortest Paths in Monge Graphs

Download www.cs.ust.hk

Tibor Dudás, R. Rudolf

Real-time Traffic

COMPUTING 1998 |

claim paper

Related Content

» Approximation algorithms for the shortest total path length spanning tree problem

» Quantum Query Complexity of Some Graph Problems

» An External Memory Data Structure for Shortest Path Queries

» AverageCase Analyses of Vickrey Costs

» Some tractable instances of interval data minmax regret problems

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» Approximation Complexity of minmax Regret Versions of Shortest Path Spanning Tree and Knap...

» Collective Tree Spanners and Routing in ATfree Related Graphs

» Congestion Games Optimization in Competition

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	COMPUTING
Authors	Tibor Dudás, R. Rudolf

Comments (0)