A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/wg/BonsmaZ08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/wg/BonsmaZ08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Florian_Zickfeld
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paul_S._Bonsma
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-92248-3%5F7
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-92248-3_7
>
dc:
identifier
DBLP conf/wg/BonsmaZ08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-92248-3%5F7
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Florian_Zickfeld
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paul_S._Bonsma
>
swrc:
pages
66-77
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/wg/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/wg/BonsmaZ08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/wg/BonsmaZ08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/wg/wg2008.html#BonsmaZ08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-92248-3_7
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/wg
>
dc:
subject
approximation algorithm; maximum leaf; connected dominating set; cubic graph
(xsd:string)
dc:
title
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document