Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/iccsa/ChenWT04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/iccsa/ChenWT04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bang_Ye_Wu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Chuan_Yi_Tang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yen_Hung_Chen
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-24767-8%5F37
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-24767-8_37
>
dc:
identifier
DBLP conf/iccsa/ChenWT04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-24767-8%5F37
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bang_Ye_Wu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Chuan_Yi_Tang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yen_Hung_Chen
>
swrc:
pages
355-366
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/iccsa/2004-3
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/iccsa/ChenWT04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/iccsa/ChenWT04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/iccsa/iccsa2004-3.html#ChenWT04
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-24767-8_37
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/iccsa
>
dc:
subject
Combinatorial optimization problem, spanning tree, approximation algorithm, polynomial time approximation scheme
(xsd:string)
dc:
title
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document