Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Polynomially solvable special cases of the Steiner problem in planar networks (1991)
    Springer
    Annals of operations research 33 (1991), S. 403-418 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We give polynomial-time algorithms for two special cases of the Steiner problem: (1) the underlying network is planar and all terminals lie within a bounded number of "layers" of a single face, and (2) the problem is the rectilinear Steiner problem and the number of rectilinear convex hulls in the entire "onion" of convex hulls is bounded. Our algorithms build on well-known dynamic programming algorithms. For the second problem, we also use some geometric arguments.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02071979
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...