Hochschulschrift
Approximation algorithms for linear programs and geometrically constrained packing roblems
- Weitere Titel
-
Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Kiel, Christian-Albrechts-Universität, Diss., 2009
- Klassifikation
-
Mathematik
- Schlagwort
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kiel
- (wer)
-
Universitätsbibliothek Kiel
- (wann)
-
2009
- Urheber
-
Diedrich, Florian
- URN
-
urn:nbn:de:gbv:8-diss-34882
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:57 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
- Diedrich, Florian
- Universitätsbibliothek Kiel
Entstanden
- 2009
Ähnliche Objekte (12)
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Approximation algorithms for scheduling and two-dimensional packing problems
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation algorithms for the interval constrained coloring problem
Algorithms for packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Approximation algorithms for scheduling and two-dimensional packing problems
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation algorithms for the interval constrained coloring problem
Algorithms for packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Improved Approximation Algorithms for Weighted k-Set Packing
Approximation algorithms for scheduling and two-dimensional packing problems
Hybrid genetic algorithms for solving constrained packing and placement problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation algorithms for the interval constrained coloring problem