ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Alles auswählen Exportieren

Digitale Medien

Polynomially solvable special cases of the Steiner problem in planar networks (1991)

Bern, Marshall ; Bienstock, Daniel

Springer

Annals of operations research 33 (1991), S. 403-418

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9338

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Notizen: 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.

Materialart: Digitale Medien

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

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer