Hochschulschrift
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
83 S.
- Sprache
-
Deutsch
- Anmerkungen
-
graph. Darst.
Berlin, Techn. Univ., Diss., 1994
- Schlagwort
-
Planarer Graph
Steiner-Baum
Packungsproblem
Effizienter Algorithmus
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:03 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Algorithms for packing problems
Algorithms for Packing Problems
Non-Preemptive Tree Packing
Plane and simple : using planar subgraphs for efficient algorithms
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Proof of the tree packing conjecture for bounded degree trees
Packing grid figures : exact algorithms and heuristics
Algorithms for geometric packing and scaling problems
Approximation algorithms for packing and scheduling problems
Parallel algorithms on planar graphs
Algorithms for packing problems
Algorithms for Packing Problems
Non-Preemptive Tree Packing
Plane and simple : using planar subgraphs for efficient algorithms
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Proof of the tree packing conjecture for bounded degree trees
Packing grid figures : exact algorithms and heuristics
Algorithms for geometric packing and scaling problems
Approximation algorithms for packing and scheduling problems
Parallel algorithms on planar graphs
Algorithms for packing problems
Algorithms for Packing Problems
Non-Preemptive Tree Packing
Plane and simple : using planar subgraphs for efficient algorithms
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Proof of the tree packing conjecture for bounded degree trees
Packing grid figures : exact algorithms and heuristics
Algorithms for geometric packing and scaling problems
Approximation algorithms for packing and scheduling problems