Hochschulschrift
Approximation algorithms for linear programs and geometrically constrained packing roblems
- Alternative title
-
Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Kiel, Christian-Albrechts-Universität, Diss., 2009
- Classification
-
Mathematik
- Keyword
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Kiel
- (who)
-
Universitätsbibliothek Kiel
- (when)
-
2009
- Creator
-
Diedrich, Florian
- URN
-
urn:nbn:de:gbv:8-diss-34882
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:57 PM CET
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
- Diedrich, Florian
- Universitätsbibliothek Kiel
Time of origin
- 2009
Other Objects (12)
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
A 2-approximation for 2D bin packing.
Approximation algorithms for packing and scheduling problems
A (5/3 + epsilon)-Approximation for Strip Packing
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
A 2-approximation for 2D bin packing.
Approximation algorithms for packing and scheduling problems
A (5/3 + epsilon)-Approximation for Strip Packing
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
A 2-approximation for 2D bin packing.
Approximation algorithms for packing and scheduling problems
A (5/3 + epsilon)-Approximation for Strip Packing
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for scheduling and two-dimensional packing problems