ZIB

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Expansion of Linear Steiner Trees (1997)

Weng, J. F.

Springer

Algorithmica 19 (1997), S. 318-330

add to mindlist on the mindlist

Details

ISSN: 1432-0541

Keywords: Key words. Steiner tree, Linear-time algorithm.

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract. A Steiner tree T on a given set of points A is called linear if all Steiner points, including those collapsing into their adjacent given points, lie on one path referred to as its trunk. Suppose A is a simple polygonal line. Roughly speaking, T is similar to A if its trunk turns right or left when A does. In this paper we prove that A can be expanded to another polygonal line, and T can be constructed in linear time using this expansion method.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/PL00009176

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit