An approximation algorithm for the k-prize-collecting multicut on a tree problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tcs/HouLH20
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tcs/HouLH20
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bo_Hou
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wen_Liu_0009
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Xin_Hou
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.tcs.2020.07.014
>
foaf:
homepage
<
https://doi.org/10.1016/j.tcs.2020.07.014
>
dc:
identifier
DBLP journals/tcs/HouLH20
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.tcs.2020.07.014
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tcs
>
rdfs:
label
An approximation algorithm for the k-prize-collecting multicut on a tree problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bo_Hou
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wen_Liu_0009
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Xin_Hou
>
swrc:
pages
26-33
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tcs/HouLH20/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tcs/HouLH20
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tcs/tcs844.html#HouLH20
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.tcs.2020.07.014
>
dc:
title
An approximation algorithm for the k-prize-collecting multicut on a tree problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
844
(xsd:string)