Sciweavers

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

35

Voted

NETWORKS
2006

favoriteEmaildiscussreport

71views Computer Networks» more NETWORKS 2006»

Upgrading arcs to minimize the maximum travel time in a network

13 years 10 months ago

Upgrading arcs to minimize the maximum travel time in a network

Download myweb.uiowa.edu

Ann Melissa Campbell, Timothy J. Lowe, Li Zhang

Real-time Traffic

Computer Networks | NETWORKS 2006 |

claim paper

Related Content

» Maximum Gain Round Trips with Cost Constraints

» Minimizing Buffer Requirements under RateOptimal Schedule in Regular Dataflow Networks

» A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tre...

» General Dynamic Routing with PerPacket Delay Guarantees of Odistance 1 session rate

» Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulat...

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	NETWORKS
Authors	Ann Melissa Campbell, Timothy J. Lowe, Li Zhang

Comments (0)