2010
DOI: 10.3745/kipsta.2010.17a.5.213
|View full text |Cite
|
Sign up to set email alerts
|

Mechanism for Connecting Input Edges Using Steiner Tree

Abstract: In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 4 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?