Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Branching solutions to one-dimensional variational problems [[electronic resource] /] / A.O. Ivanov & A.A. Tuzhilin
| Branching solutions to one-dimensional variational problems [[electronic resource] /] / A.O. Ivanov & A.A. Tuzhilin |
| Autore | Ivanov A. O (Alexander O.) |
| Pubbl/distr/stampa | Singapore ; ; River Edge, NJ, : World Scientific, c2001 |
| Descrizione fisica | 1 online resource (365 p.) |
| Disciplina | 515.64 |
| Altri autori (Persone) | TuzhilinA. A |
| Soggetto topico |
Extremal problems (Mathematics)
Steiner systems |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-95636-8
9786611956363 981-281-071-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; Chapter 1 Preliminary Results; 1.1 Graphs; 1.1.1 Topological and framed graphs their equivalence; 1.1.2 Operations on graphs; 1.1.3 Boundary of graph local graph; 1.1.4 Smooth structure on topological graph; 1.2 Parametric networks; 1.2.1 Main definitions; 1.2.2 Classes of networks' smoothness; 1.3 Network-traces; 1.3.1 Networks-traces and their canonical representatives; 1.4 Stating of variational problem; 1.4.1 Construction of edge functionals; 1.4.2 Construction of edge functionals for networks with fixed topology; Chapter 2 Networks Extremality Criteria
2.1 Local structure of extreme parametric networks2.2 Local structure of extreme networks-traces; 2.2.1 Smooth Lagrangians; 2.2.2 Quasiregular Lagrangians; Chapter 3 Linear Networks in RN; 3.1 Mutually parallel linear networks with a given boundary; 3.2 Geometry of planar linear trees; 3.2.1 Twisting number of planar linear tree; 3.2.2 Main theorem; 3.3 On the proof of Theorem 3.2; 3.3.1 Planar polygonal lines I: the case of general position; 3.3.2 Planar polygonal lines II: the general case; 3.3.3 Twisting number of a planar linear tree; 3.3.4 Proof of Theorem 3.2 Chapter 4 Extremals of Length Type Functionals: The Case of Parametric Networks4.1 Parametric networks extreme with respect to Riemannian length functional; 4.2 Local structure of weighted extreme parametric networks; 4.3 Polyhedron of extreme weighted networks in space having some given type and boundary; 4.3.1 Structure of the set of extreme weighted networks; 4.3.2 Immersed extreme weighted Steiner networks in the plane; 4.4 Global structure of planar extreme weighted trees; 4.5 Geometry of planar embedded extreme weighted binary trees 4.5.1 Twisting number of embedded planar weighted binary treesChapter 5 Extremals of the Length Functional: The Case of Networks-Traces; 5.1 Minimal networks on Euclidean plane; 5.1.1 Correspondence between planar binary trees and diagonal triangulations; 5.1.2 Structural elements of diagonal triangulations; 5.1.3 Tiling realization of binary trees whose twisting number is at most five; 5.1.4 Tilings and their properties; 5.1.5 Structural elements of skeletons from WP5; 5.1.6 Operations of reduction and antireduction; 5.1.7 Profiles and their properties 5.1.8 Classification Theorem for skeletons from WP55.1.9 Location of the growths of tilings from WP5 on their skeletons; 5.1.10 Theorem of realization; 5.1.11 Minimal binary trees with regular boundary; 5.1.12 Growths and linear parts of minimal networks with convex boundaries; 5.1.13 Quasiregular polygons which cannot be spanned by minimal binary trees; 5.1.14 Non-degenerate minimal networks with convex boundary. Cyclical case; 5.2 Closed minimal networks on closed surfaces of constant curvature; 5.2.1 Minimal networks on surfaces of constant positive curvature 5.2.2 Classification of closed minimal networks on flat tori |
| Record Nr. | UNINA-9910453554303321 |
Ivanov A. O (Alexander O.)
|
||
| Singapore ; ; River Edge, NJ, : World Scientific, c2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Branching solutions to one-dimensional variational problems [[electronic resource] /] / A.O. Ivanov & A.A. Tuzhilin
| Branching solutions to one-dimensional variational problems [[electronic resource] /] / A.O. Ivanov & A.A. Tuzhilin |
| Autore | Ivanov A. O (Alexander O.) |
| Pubbl/distr/stampa | Singapore ; ; River Edge, NJ, : World Scientific, c2001 |
| Descrizione fisica | 1 online resource (365 p.) |
| Disciplina | 515.64 |
| Altri autori (Persone) | TuzhilinA. A |
| Soggetto topico |
Extremal problems (Mathematics)
Steiner systems |
| ISBN |
1-281-95636-8
9786611956363 981-281-071-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; Chapter 1 Preliminary Results; 1.1 Graphs; 1.1.1 Topological and framed graphs their equivalence; 1.1.2 Operations on graphs; 1.1.3 Boundary of graph local graph; 1.1.4 Smooth structure on topological graph; 1.2 Parametric networks; 1.2.1 Main definitions; 1.2.2 Classes of networks' smoothness; 1.3 Network-traces; 1.3.1 Networks-traces and their canonical representatives; 1.4 Stating of variational problem; 1.4.1 Construction of edge functionals; 1.4.2 Construction of edge functionals for networks with fixed topology; Chapter 2 Networks Extremality Criteria
2.1 Local structure of extreme parametric networks2.2 Local structure of extreme networks-traces; 2.2.1 Smooth Lagrangians; 2.2.2 Quasiregular Lagrangians; Chapter 3 Linear Networks in RN; 3.1 Mutually parallel linear networks with a given boundary; 3.2 Geometry of planar linear trees; 3.2.1 Twisting number of planar linear tree; 3.2.2 Main theorem; 3.3 On the proof of Theorem 3.2; 3.3.1 Planar polygonal lines I: the case of general position; 3.3.2 Planar polygonal lines II: the general case; 3.3.3 Twisting number of a planar linear tree; 3.3.4 Proof of Theorem 3.2 Chapter 4 Extremals of Length Type Functionals: The Case of Parametric Networks4.1 Parametric networks extreme with respect to Riemannian length functional; 4.2 Local structure of weighted extreme parametric networks; 4.3 Polyhedron of extreme weighted networks in space having some given type and boundary; 4.3.1 Structure of the set of extreme weighted networks; 4.3.2 Immersed extreme weighted Steiner networks in the plane; 4.4 Global structure of planar extreme weighted trees; 4.5 Geometry of planar embedded extreme weighted binary trees 4.5.1 Twisting number of embedded planar weighted binary treesChapter 5 Extremals of the Length Functional: The Case of Networks-Traces; 5.1 Minimal networks on Euclidean plane; 5.1.1 Correspondence between planar binary trees and diagonal triangulations; 5.1.2 Structural elements of diagonal triangulations; 5.1.3 Tiling realization of binary trees whose twisting number is at most five; 5.1.4 Tilings and their properties; 5.1.5 Structural elements of skeletons from WP5; 5.1.6 Operations of reduction and antireduction; 5.1.7 Profiles and their properties 5.1.8 Classification Theorem for skeletons from WP55.1.9 Location of the growths of tilings from WP5 on their skeletons; 5.1.10 Theorem of realization; 5.1.11 Minimal binary trees with regular boundary; 5.1.12 Growths and linear parts of minimal networks with convex boundaries; 5.1.13 Quasiregular polygons which cannot be spanned by minimal binary trees; 5.1.14 Non-degenerate minimal networks with convex boundary. Cyclical case; 5.2 Closed minimal networks on closed surfaces of constant curvature; 5.2.1 Minimal networks on surfaces of constant positive curvature 5.2.2 Classification of closed minimal networks on flat tori |
| Record Nr. | UNINA-9910782275903321 |
|
Ivanov A. O (Alexander O.)
|
||
| Singapore ; ; River Edge, NJ, : World Scientific, c2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Minimal networks : the Steiner problem and its generalizations / Alexandr O. Ivanov, Alexei A. Tuzhilin
| Minimal networks : the Steiner problem and its generalizations / Alexandr O. Ivanov, Alexei A. Tuzhilin |
| Autore | Ivanov, Alexandr O. |
| Pubbl/distr/stampa | Boca Raton, Fla : CRC Press, c1994 |
| Descrizione fisica | xviii, 414 p. : ill. ; 25 cm. |
| Disciplina | 511.5 |
| Altri autori (Persone) | Tuzhilin, Alexei A. |
| Soggetto topico | Steiner systems |
| ISBN | 084938642X |
| Classificazione |
AMS 05C05
AMS 52-02 QA1666.3.I93 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001146599707536 |
|
Ivanov, Alexandr O.
|
||
| Boca Raton, Fla : CRC Press, c1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Steiner minimal trees / by Dietmar Cieslik
| Steiner minimal trees / by Dietmar Cieslik |
| Autore | Cieslik, Dietmar |
| Pubbl/distr/stampa | Dordrecht ; Boston ; London : Kluwer Academic, c1998 |
| Descrizione fisica | xi, 319 p. : ill. ; 25 cm |
| Disciplina | 511.5 |
| Collana | Nonconvex optimization and its applications ; 23 |
| Soggetto topico |
Steiner systems
Trees |
| ISBN | 0792349830 |
| Classificazione |
AMS 05C05
AMS 05C90 LC QA166.3.C54 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991004022079707536 |
|
Cieslik, Dietmar
|
||
| Dordrecht ; Boston ; London : Kluwer Academic, c1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu
| Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu |
| Autore | Du Dingzhu |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2008 |
| Descrizione fisica | 1 online resource (xiii, 359 p. ) : ill |
| Disciplina | 004.6 |
| Altri autori (Persone) | HuXiaodong |
| Soggetto topico |
Steiner systems
Computer networks |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-93394-5
9786611933944 981-279-145-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. |
| Record Nr. | UNINA-9910453538903321 |
|
Du Dingzhu
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu
| Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu |
| Autore | Du Dingzhu |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2008 |
| Descrizione fisica | 1 online resource (xiii, 359 p. ) : ill |
| Disciplina | 004.6 |
| Altri autori (Persone) | HuXiaodong |
| Soggetto topico |
Steiner systems
Computer networks |
| ISBN |
1-281-93394-5
9786611933944 981-279-145-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. |
| Record Nr. | UNINA-9910782273603321 |
|
Du Dingzhu
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Sui sistemi di terne di Steiner. Tesi di laurea / laureanda E. Bortone ; relat. D. Lenzi
| Sui sistemi di terne di Steiner. Tesi di laurea / laureanda E. Bortone ; relat. D. Lenzi |
| Autore | Bortone, Emma |
| Pubbl/distr/stampa | Lecce : Università degli studi. Facoltà di Scienze. Corso di laurea in Matematica, a.a. 1985-86 |
| Altri autori (Persone) | Lenzi, Domenico |
| Soggetto topico |
Combinatorics
Steiner systems Triple systems |
| Classificazione |
AMS 05-XX
AMS 05B07 AMS 51E10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNISALENTO-991001396079707536 |
|
Bortone, Emma
|
||
| Lecce : Università degli studi. Facoltà di Scienze. Corso di laurea in Matematica, a.a. 1985-86 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Soggetto topico
-
Steiner systems
(7)
- Computer networks (2)
- Extremal problems (Mathematics) (2)
- Combinatorics (1)
- Trees (1)