A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

Holger Bast, Kurt Mehlhorn, Guido Schäfer

Journal Title: Algorithmica

Date: 2003

Volume: 36

Issue: 1

p. 75 - 88

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-002-1008-z

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12