Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/fsttcs/KonemannR03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/fsttcs/KonemannR03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jochen_K%E2%88%9A%E2%88%82nemann
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/R._Ravi_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-24597-1%5F25
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-24597-1_25
>
dc:
identifier
DBLP conf/fsttcs/KonemannR03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-24597-1%5F25
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
rdfs:
label
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jochen_K%E2%88%9A%E2%88%82nemann
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/R._Ravi_0001
>
swrc:
pages
289-301
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/fsttcs/2003
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/fsttcs/KonemannR03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/fsttcs/KonemannR03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#KonemannR03
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-24597-1_25
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/fsttcs
>
dc:
title
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document