An approximation algorithm for the maximum leaf spanning arborescence problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/DrescherV10
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/DrescherV10
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Adrian_Vetta
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Matthew_Drescher
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1798596.1798599
>
foaf:
homepage
<
https://doi.org/10.1145/1798596.1798599
>
dc:
identifier
DBLP journals/talg/DrescherV10
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1798596.1798599
(xsd:string)
dcterms:
issued
2010
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
An approximation algorithm for the maximum leaf spanning arborescence problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Adrian_Vetta
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Matthew_Drescher
>
swrc:
number
3
(xsd:string)
swrc:
pages
46:1-46:18
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/DrescherV10/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/DrescherV10
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg6.html#DrescherV10
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1798596.1798599
>
dc:
title
An approximation algorithm for the maximum leaf spanning arborescence problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
6
(xsd:string)