ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover Page block firm and clean, binding unblemished, boards straight, no markings of any kind. Fine, like new condition. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010.
[San Rafael, CA, U.S.A.] [Publication Year: 2002]

New. Page block firm and clean, binding unblemished, boards straight, no markings of any kind. Fine, like new condition. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010. ISBN 3540441344 9783540441342 [US]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover sehr guter Zustand. nur kleiner hick am cover, A-622
[Basel, Switzerland] [Publication Year: 2002]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer-Verlag Gmbh Okt 2002] Hardcover Neuware -Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in ...
Show/Hide image

Springer Verlag, Date: 2002. Hardcover. New. 2nd sub edition. 544 pages. German language. 9.25x6.50x1.50 inches. 2002. Springer Verlag ISBN 3540441344 9783540441342 [GB]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover New Book. Shipped from UK. Established seller since 2000.
[Fairford, GLOS, United Kingdom] [Publication Year: 2004]

Springer 4/14/2004 12: 00: 00 AM 2nd ed. 2003. Corr. 2nd printing 2004 Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer Berlin Heidelberg] Hardcover A textbook as well as a handbook on the kernel of current algorithmics With many examples to support the understandingAlgorithmic design, especially for hard problems, is more essential for success in solving them than any standard improve.
[Greven, Germany] [Publication Year: 2002]
Show/Hide image

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover
[Dallas, TX, U.S.A.] [Publication Year: 2002]

Springer 2002-10-09 2nd 2003. Corr. 2nd Printing ed. Hardcover New Size: 98x19x147; New. In shrink wrap. Looks like an interesting title!

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover
[Castle Donington, DERBY, United Kingdom] [Publication Year: 2002]
Show/Hide image

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover New. Fast Shipping and good customer service
[Fayetteville, TX, U.S.A.] [Publication Year: 2002]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer, NY] Hardcover A nice, bright copy. ; 9.3 X 6.2 X 1.3 inches; 544 pages
[Portland, OR, U.S.A.] [Publication Year: 2003]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer 2002-10-09] Hardcover
[Wallingford, United Kingdom] [Publication Year: 2002]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover
[Bayonne, NJ, U.S.A.] [Publication Year: 2002]
Show/Hide image

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer] Hardcover Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within
[Amherst, NY, U.S.A.] [Publication Year: 2002]

Berlin |London Springer Berlin Heidelberg 2002 2nd 2003. Corr. 2nd Printing ed. Hard cover New in new dust jacket.

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer Berlin Heidelberg 2002-10-09, Berlin |London] Hardcover Language: ENG
[London, United Kingdom] [Publication Year: 2002]

Bath: Springer, Date: 2003. Second Edition. Hardcover. Good. xiii, 544 p. 24 cm. 71 figures. Stain on front cover. Ink signature on front free endpaper. A little dust on text block edge. A few wrinkles to some front pages. 2003. Springer ISBN 3540441344 9783540441342 [CA]

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer, Bath] Hardcover xiii, 544 p. 24 cm. 71 figures. Stain on front cover. Ink signature on front free endpaper. A little dust on text block edge. A few wrinkles to some front pages.
[London, ON, Canada] [Publication Year: 2003]
Show/Hide image

ISBN10: 3540441344, ISBN13: 9783540441342, [publisher: Springer-Verlag Gmbh Okt 2002] Hardcover Neuware - Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in ...
Show/Hide image