Finding the Minimum-Cost Path Without Cutting Corners.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/scia/HeekerenFV07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/scia/HeekerenFV07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Frank_G._A._Faas
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lucas_J._van_Vliet
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/R._Joop_van_Heekeren
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-73040-8%5F27
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-73040-8_27
>
dc:
identifier
DBLP conf/scia/HeekerenFV07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-73040-8%5F27
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
rdfs:
label
Finding the Minimum-Cost Path Without Cutting Corners.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Frank_G._A._Faas
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lucas_J._van_Vliet
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/R._Joop_van_Heekeren
>
swrc:
pages
263-272
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/scia/2007
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/scia/HeekerenFV07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/scia/HeekerenFV07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/scia/scia2007.html#HeekerenFV07
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-73040-8_27
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/scia
>
dc:
title
Finding the Minimum-Cost Path Without Cutting Corners.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document