Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms

Bast, H., Mehlhorn, K., Schäfer, G., & Tamaki, H. (2003). A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms. Algorithmica, 36, 75-88.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C0B-7 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C0C-5
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Bast, Holger1, Autor           
Mehlhorn, Kurt1, Autor           
Schäfer, Guido1, Autor           
Tamaki, Hisao1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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 12 was achieved. We also present a partial analysis that gives some theoretical support for our experimental findings.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2004-06-172003
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 201912
Anderer: Local-ID: C1256428004B93B8-6EE356D1B824CE83C1256D03005D49A1-BMST03
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Algorithmica
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 36 Artikelnummer: - Start- / Endseite: 75 - 88 Identifikator: -