Hochschulschrift
Algorithms for interval coloring, geometric packing and memory optimization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
225 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Saarbrücken, Univ., Diss., 2001
- Keyword
-
Graphfärbung
Berechnungstheorie
Effizienter Algorithmus
- Creator
-
Gergov, Jordan
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:14 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Gergov, Jordan
Other Objects (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
Sublinear geometric algorithms
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Packing grid figures : exact algorithms and heuristics
New parameterized algorithms for matching and packing 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
Sublinear geometric algorithms
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Packing grid figures : exact algorithms and heuristics
New parameterized algorithms for matching and packing 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
Sublinear geometric algorithms
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Packing grid figures : exact algorithms and heuristics