Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/sirocco/ClementiIMLRS05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ClementiIMLRS05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_E._F._Clementi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Angelo_Monti
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gianluca_Rossi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Massimo_Lauria
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Miriam_Di_Ianni
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Riccardo_Silvestri
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F11429647%5F9
>
foaf:
homepage
<
https://doi.org/10.1007/11429647_9
>
dc:
identifier
DBLP conf/sirocco/ClementiIMLRS05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F11429647%5F9
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
rdfs:
label
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_E._F._Clementi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Angelo_Monti
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gianluca_Rossi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Massimo_Lauria
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Miriam_Di_Ianni
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Riccardo_Silvestri
>
swrc:
pages
89-98
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/sirocco/2005
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/sirocco/ClementiIMLRS05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/sirocco/ClementiIMLRS05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/sirocco/sirocco2005.html#ClementiIMLRS05
>
rdfs:
seeAlso
<
https://doi.org/10.1007/11429647_9
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/sirocco
>
dc:
title
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document