Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/gecco/GruberR09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/gecco/GruberR09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/G%E2%88%9A%C4%BEnther_R._Raidl
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Martin_Gruber
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1569901.1569939
>
foaf:
homepage
<
https://doi.org/10.1145/1569901.1569939
>
dc:
identifier
DBLP conf/gecco/GruberR09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1569901.1569939
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/G%E2%88%9A%C4%BEnther_R._Raidl
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Martin_Gruber
>
swrc:
pages
263-270
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/gecco/2009g
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/gecco/GruberR09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/gecco/GruberR09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/gecco/gecco2009.html#GruberR09
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1569901.1569939
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/gecco
>
dc:
subject
bounded diameter minimum spanning tree, construction heuristics, dynamic programming, greedy randomized search, local improvement
(xsd:string)
dc:
title
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document