Computing almost shortest paths. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/talg/Elkin05>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Michael_Elkin>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F1103963.1103968>
foaf:homepage	<https://doi.org/10.1145/1103963.1103968>
dc:identifier	DBLP journals/talg/Elkin05 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F1103963.1103968 (xsd:string)
dcterms:issued	2005 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/talg>
rdfs:label	Computing almost shortest paths. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Michael_Elkin>
swrc:number	2 (xsd:string)
swrc:pages	283-323 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/talg/Elkin05/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/talg/Elkin05>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/talg/talg1.html#Elkin05>
rdfs:seeAlso	<https://doi.org/10.1145/1103963.1103968>
dc:subject	Graph algorithms, almost shortest paths, spanners (xsd:string)
dc:title	Computing almost shortest paths. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	1 (xsd:string)