- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Algorithm Theory – SWAT 2008 / Gudmundsson, Joachim (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. - (Lecture Notes in Computer Science). - S. 210-221. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-540-69900-2
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2011
- Urheber
-
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
- URN
-
urn:nbn:de:bsz:352-opus-121999
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:04 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.
Beteiligte
- Althaus, Ernst
- Canzar, Stefan
- Elbassioni, Khaled
- Karrenbauer, Andreas
- Mestre, Julián
- Bibliothek der Universität Konstanz
Entstanden
- 2011
Ähnliche Objekte (12)
Approximation algorithms for the interval constrained coloring problem
The Interval Constrained 3-Coloring Problem
Balanced interval coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Algorithms for interval coloring, geometric packing and memory optimization
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Iterative approximation of solutions for constrained convex minimization problem
A new interval-valued approximation of interval-valued fuzzy numbers
Second order Lagrange multiplier approximation for constrained shape optimization problems
New Results on the Robust Coloring Problem
Approximation algorithms for the interval constrained coloring problem
The Interval Constrained 3-Coloring Problem
Balanced interval coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Algorithms for interval coloring, geometric packing and memory optimization
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Iterative approximation of solutions for constrained convex minimization problem
A new interval-valued approximation of interval-valued fuzzy numbers
Second order Lagrange multiplier approximation for constrained shape optimization problems
New Results on the Robust Coloring Problem
Approximation algorithms for the interval constrained coloring problem
The Interval Constrained 3-Coloring Problem
Balanced interval coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Algorithms for interval coloring, geometric packing and memory optimization
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Iterative approximation of solutions for constrained convex minimization problem
A new interval-valued approximation of interval-valued fuzzy numbers
Second order Lagrange multiplier approximation for constrained shape optimization problems