Type of Publication:  Contribution to a conference collection 
URI (citable link):  http://nbnresolving.de/urn:nbn:de:bsz:352212881 
Author:  Aljazzar, Husain; Leue, Stefan 
Year of publication:  2010 
Summary: 
We present a search algorithm, called K*, for finding the k shortest paths (KSP) between a designated pair of vertices in a given directed weighted graph. As a directed algorithm, K* has two advantages compared to current KSP algorithms. First, K* performs onthefly, which means that it does not require the graph to be explicitly available and stored in main memory. Portions of the graph will be generated as needed. Second, K* can be guided using heuristic functions. We discuss the properties of K*, including its correctness, and its asymptotic worstcase complexity, which has been shown to be of O(m+n log n+k) with respect to both runtime and space, where n is the number of vertices and m is the number of edges of the graph. We report on experimental results which illustrate the favorable performance of K* compared to the most efficient kshortestpaths algorithms known so far. In other work it has been shown that K* can be used to efficiently compute counterexamples for stochastic model checking.

Subject (DDC):  004 Computer Science 
Comment on publication:  Paper presented at: Sixth Workshop on Model Checking and Artificial Intelligence (MoChArt) 2010 
Link to License:  In Copyright 
Bibliography of Konstanz:  Yes 
ALJAZZAR, Husain, Stefan LEUE, 2010. K* : heuristicsguided, onthefly k shortest paths search
@inproceedings{Aljazzar2010heuri21288, title={K* : heuristicsguided, onthefly k shortest paths search}, year={2010}, author={Aljazzar, Husain and Leue, Stefan}, note={Paper presented at: Sixth Workshop on Model Checking and Artificial Intelligence (MoChArt) 2010} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22rdfsyntaxns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digitalrepositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.unikonstanz.de/rdf/resource/123456789/21288"> <dcterms:issued>2010</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.unikonstanz.de/bitstream/123456789/21288/1/aljazzar_212881.pdf"/> <bibo:uri rdf:resource="http://kops.unikonstanz.de/handle/123456789/21288"/> <dc:contributor>Leue, Stefan</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20130312T13:19:01Z</dc:date> <dcterms:abstract xml:lang="eng">We present a search algorithm, called K*, for finding the k shortest paths (KSP) between a designated pair of vertices in a given directed weighted graph. As a directed algorithm, K* has two advantages compared to current KSP algorithms. First, K* performs onthefly, which means that it does not require the graph to be explicitly available and stored in main memory. Portions of the graph will be generated as needed. Second, K* can be guided using heuristic functions. We discuss the properties of K*, including its correctness, and its asymptotic worstcase complexity, which has been shown to be of O(m+n log n+k) with respect to both runtime and space, where n is the number of vertices and m is the number of edges of the graph. We report on experimental results which illustrate the favorable performance of K* compared to the most efficient kshortestpaths algorithms known so far. In other work it has been shown that K* can be used to efficiently compute counterexamples for stochastic model checking.</dcterms:abstract> <dc:rights>termsofuse</dc:rights> <dc:contributor>Aljazzar, Husain</dc:contributor> <dc:creator>Aljazzar, Husain</dc:creator> <dcterms:title>K* : heuristicsguided, onthefly k shortest paths search</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20130312T13:19:01Z</dcterms:available> <dc:language>eng</dc:language> <dc:creator>Leue, Stefan</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.unikonstanz.de/bitstream/123456789/21288/1/aljazzar_212881.pdf"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:isPartOf rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>
aljazzar_212881.pdf  152 