An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ispd/LongZM08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ispd/LongZM08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hai_Zhou_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jieyi_Long
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Seda_Ogrenci_Memik
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1353629.1353658
>
foaf:
homepage
<
https://doi.org/10.1145/1353629.1353658
>
dc:
identifier
DBLP conf/ispd/LongZM08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1353629.1353658
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hai_Zhou_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jieyi_Long
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Seda_Ogrenci_Memik
>
swrc:
pages
126-133
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ispd/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ispd/LongZM08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ispd/LongZM08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ispd/ispd2008.html#LongZM08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1353629.1353658
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ispd
>
dc:
subject
minimum terminal spanning tree, physical design, routing, spanning graph, steiner tree
(xsd:string)
dc:
title
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document