Hochschulschrift
Algorithms for interval coloring, geometric packing and memory optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
225 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Saarbrücken, Univ., Diss., 2001
- Schlagwort
-
Graphfärbung
Berechnungstheorie
Effizienter Algorithmus
- Urheber
-
Gergov, Jordan
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:14 MESZ
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
- Gergov, Jordan
Ähnliche Objekte (12)
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Algorithms for Packing Problems
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
In-Memory Interval Joins
Approximation algorithms for 2d packing problems
Sublinear geometric algorithms
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Algorithms for Packing Problems
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
In-Memory Interval Joins
Approximation algorithms for 2d packing problems
Sublinear geometric algorithms
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Algorithms for Packing Problems
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
In-Memory Interval Joins
Approximation algorithms for 2d packing problems
Sublinear geometric algorithms
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems