An auction-based approach for the re-optimization shortest path tree problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/coap/FestaGN19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/coap/FestaGN19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Antonio_Napoletano
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Francesca_Guerriero
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paola_Festa
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10589-019-00132-7
>
foaf:
homepage
<
https://doi.org/10.1007/s10589-019-00132-7
>
dc:
identifier
DBLP journals/coap/FestaGN19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10589-019-00132-7
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/coap
>
rdfs:
label
An auction-based approach for the re-optimization shortest path tree problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Antonio_Napoletano
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Francesca_Guerriero
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paola_Festa
>
swrc:
number
3
(xsd:string)
swrc:
pages
851-893
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/coap/FestaGN19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/coap/FestaGN19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/coap/coap74.html#FestaGN19
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10589-019-00132-7
>
dc:
title
An auction-based approach for the re-optimization shortest path tree problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
74
(xsd:string)