Non-Preemptive Tree Packing

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
In: 10.1007/s00453-022-01026-7

Event
Veröffentlichung
(where)
Aachen
(who)
Universitätsbibliothek der RWTH Aachen
(when)
2022
Creator
Lendl, Stefan
Woeginger, Gerhard
Wulf, Lasse

DOI
10.18154/RWTH-2022-08731
URN
urn:nbn:de:101:1-2022091001375609937390
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
25.03.2025, 1:53 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

  • Lendl, Stefan
  • Woeginger, Gerhard
  • Wulf, Lasse
  • Universitätsbibliothek der RWTH Aachen

Time of origin

  • 2022

Other Objects (12)

Proof of the tree packing conjecture for bounded degree trees

zweidimensionales bewegtes Bild

Proof of the tree packing conjecture for bounded degree trees

Efficient algorithms for disjoint Steiner trees packing problems in planar graphs

Hochschulschrift

Efficient algorithms for disjoint Steiner trees packing problems in planar graphs

Container packing

Container packing

On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B

zweidimensionales bewegtes Bild

On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B

Recognizing Court-Packing

Recognizing Court-Packing

Packing returning secretaries

Packing returning secretaries

European Packing Federation

Schriftgut

European Packing Federation

Chapter XIX. Packing

Kapitel

Chapter XIX. Packing

Algorithmic Symplectic Packing

Algorithmic Symplectic Packing

Packing the Mule

Kapitel

Packing the Mule

Algorithms for packing problems

Hochschulschrift

Algorithms for packing problems

Two-dimensional packing problems

Hochschulschrift

Two-dimensional packing problems

Related objects