Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/KonemannLS04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/KonemannLS04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Amitabh_Sinha
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Asaf_Levin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jochen_K%E2%88%9A%E2%88%82nemann
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-004-1121-2
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-004-1121-2
>
dc:
identifier
DBLP journals/algorithmica/KonemannLS04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-004-1121-2
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Amitabh_Sinha
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Asaf_Levin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jochen_K%E2%88%9A%E2%88%82nemann
>
swrc:
number
2
(xsd:string)
swrc:
pages
117-129
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/KonemannLS04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/KonemannLS04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica41.html#KonemannLS04
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-004-1121-2
>
dc:
subject
Approximation algorithms; Spanning trees; Bicriteria approximation; Degree-bounded spanning trees
(xsd:string)
dc:
title
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
41
(xsd:string)