@inproceedings{Aljazzar2010heuri-21288,
  year={2010},
  title={K* : heuristics-guided, on-the-fly k shortest paths search},
  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/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.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.uni-konstanz.de/server/rdf/resource/123456789/21288">
    <dcterms:title>K* : heuristics-guided, on-the-fly k shortest paths search</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-12T13:19:01Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2010</dcterms:issued>
    <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 on-the-fly, 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 worst-case 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 k-shortest-paths 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:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-12T13:19:01Z</dc:date>
    <dc:rights>terms-of-use</dc:rights>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21288/1/aljazzar_212881.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Leue, Stefan</dc:creator>
    <dc:contributor>Aljazzar, Husain</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21288/1/aljazzar_212881.pdf"/>
    <dc:creator>Aljazzar, Husain</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/21288"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Leue, Stefan</dc:contributor>
  </rdf:Description>
</rdf:RDF>