Hromkovič, Juraj: Algorithmics for hard problems
: introduction to combinatorial optimization, randomization, approximation, and heuristics / Juraj Hromkovič. - Berlin : Springer, 2001. - XI, 492 S. : graph. Darst.; 24 cm - (Texts in theoretical computer science)
ISBN 978-3-540-66860-2 / 3-540-66860-8 Pp. : DM 89.00
Literaturverz. S. 459 - 480
Quelle: DNB
Hromkovič, Juraj: Algorithmics for hard problems
: introduction to combinatorial optimization, randomization, approximation, and heuristics / Juraj Hromkovič. - 2. ed. - Berlin : Springer, 2003. - XIII, 544 S. : graph. Darst.; 24 cm - (Texts in theoretical computer science)
ISBN 978-3-540-44134-2 / 3-540-44134-4 Pp. : EUR 53.45
Literaturverz. S. 511 - 532
Quelle: DNB
Algorithms and computation
: 10th international symposium ; proceedings / ISAAC '99, Chennai, India, December 1999. A. Aggarwal ... (ed.). - Berlin : Springer, 2000. - Online-Ressource - (Lecture notes in computer science; 1741)
ISBN 978-3-540-46632-1
Lizenzpflichtig
Quelle: DNB
Algorithms for approximation
: proceedings of the 5th international conference, Chester, July 2005 ; with 21 tables / A. Iske ; J. Levesley, ed.. - Berlin : Springer, 2007. - XIII, 389 S. : Ill., graph. Darst.; 24 cm
ISBN 978-3-540-33283-1 / 3-540-33283-9 Pp. : EUR 85.55
Literaturangaben
Quelle: DNB Verlagsmeldungen
Algorithms in bioinformatics
: second international workshop ; proceedings / WABI 2002, Rome, Italy, September 17 - 21, 2002. R. Guigó ... (ed.). - Berlin : Springer, 2002. - Online-Ressource - (Lecture notes in computer science; 2452)
ISBN 978-3-540-45784-8
Lizenzpflichtig
Quelle: DNB
Algorithms in bioinformatics
: first international workshop ; proceedings / WABI 2001, °Aarhus Denmark, August 28 - 31, 2001. O. Gascuel ... (ed.). - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 2149)
ISBN 978-3-540-44696-5
Lizenzpflichtig
Quelle: DNB
Approximation, randomization and combinatorial optimization
: algorithms and techniques ; proceedings / 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 ..., RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001. M. Goemans ... (ed.). - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 2129)
ISBN 978-3-540-44666-8
Lizenzpflichtig
Quelle: DNB
Approximation, randomization and combinatorial optimization
: algorithms and techniques ; proceedings / 9th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28 - 30, 2006. Josep Diaz ... (ed.). - Berlin : Springer, 2006. - Online-Ressource - (Lecture notes in computer science; 4110)
ISBN 978-3-540-38045-0
Lizenzpflichtig
Quelle: DNB
Approximation, randomization, and combinatorial optimization
: algorithms and techniques ; proceedings / 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24 - 26,. - Berlin : Springer, 2003. - Online-Ressource - (Lecture notes in computer science; 2764)
ISBN 978-3-540-45198-3
Lizenzpflichtig
Quelle: DNB
Approximation, randomization, and combinatorial optimization
: algorithms and techniques ; Boston, MA, USA, August 25 - 27, 2008 ; proceedings / 11th international workshop, APPROX 2008 and 12th international workshop, RANDOM 2008. Ashish Goel ... (ed.). - Berlin : Springer, 2008. - Online-Ressource - (Lecture notes in computer science; 5171)
ISBN 978-3-540-85363-3
Lizenzpflichtig
Quelle: DNB
