English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms

Mehlhorn, K., & Schäfer, G. (2001). A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01) (pp. 242-253). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-314B-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-314E-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Schäfer, Guido1, Author           
Meyer auf der Heide, Friedhelm, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We consider the single-source many-targets shortest-path (SSMTSP) problem in directed graphs with non-negative edge weights. A source node $s$ and a target set $T$ is specified and the goal is to compute a shortest path from $s$ to a node in $T$. Our interest in the shortest path problem with many targets stems from its use in weighted bipartite matching algorithms. A weighted bipartite matching in a graph with $n$ nodes on each side reduces to $n$ SSMTSP problems, where the number of targets varies between $n$ and $1$. The SSMTSP problem can be solved by Dijkstra's algorithm. We describe a heuristic that leads to a significant improvement in running time for the weighted matching problem; in our experiments a speed-up by up to a factor of 10 was achieved. We also present a partial analysis that gives some theoretical support for our experimental findings.

Details

show
hide
Language(s): eng - English
 Dates: 2002-04-252001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344460
Other: Local-ID: C1256428004B93B8-39BAFD1DB51E60C5C1256B570055CEAD-MehlhornSchaefer2001
 Degree: -

Event

show
hide
Title: ESA 2001
Place of Event: Arhus, Denmark
Start-/End Date: 2001-08-18 - 2001-08-31

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 242 - 253 Identifier: ISBN: 3-540-42493-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2161 Sequence Number: - Start / End Page: - Identifier: -