An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ol/LeiSWL23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ol/LeiSWL23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hu_Shao
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pengjie_Liu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ting_Wu_0009
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yi_Lei
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs11590-022-01916-3
>
foaf:
homepage
<
https://doi.org/10.1007/s11590-022-01916-3
>
dc:
identifier
DBLP journals/ol/LeiSWL23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs11590-022-01916-3
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ol
>
rdfs:
label
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hu_Shao
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pengjie_Liu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ting_Wu_0009
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yi_Lei
>
swrc:
month
March
(xsd:string)
swrc:
number
2
(xsd:string)
swrc:
pages
453-469
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ol/LeiSWL23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ol/LeiSWL23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ol/ol17.html#LeiSWL23
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s11590-022-01916-3
>
dc:
title
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
17
(xsd:string)