Parallel algorithms and aggregation for solving shortest-path problems

Romeijn, H. Edwin; Smith, Robert L.

Parallel algorithms and aggregation for solving shortest-path problems

dc.contributor.author	Romeijn, H. Edwin	en_US
dc.contributor.author	Smith, Robert L.	en_US
dc.date.accessioned	2014-09-26T13:01:37Z
dc.date.available	NO_RESTRICTION	en_US
dc.date.available	2014-09-26T13:01:37Z
dc.date.issued	1992-02
dc.identifier	84262	en_US
dc.identifier.other	IVHS Technical Report-92-06	en_US
dc.identifier.uri	https://hdl.handle.net/2027.42/108515
dc.description.sponsorship	Intelligent Vehicle-Highway Systems, U-M College of Engineering	en_US
dc.format.extent	20	en_US
dc.language	English	en_US
dc.publisher	University of Michigan, Ann Arbor, Transportation Research Institute	en_US
dc.title	Parallel algorithms and aggregation for solving shortest-path problems	en_US
dc.type	Technical Report	en_US
dc.subject.hlbsecondlevel	Transportation
dc.subject.hlbtoplevel	Engineering
dc.description.bitstreamurl	http://deepblue.lib.umich.edu/bitstream/2027.42/108515/1/84262.pdf
dc.description.filedescription	Description of 84262.pdf : Final report
dc.owningcollname	Transportation Research Institute (UMTRI)

Files in this item

Name:: 84262.pdf
Size:: 5.793MB
Format:: PDF
Description:: Final report

View/Open

Transportation Research Institute (UMTRI)

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.