 |
|
|
Item Details
| Title:
|
DESIGN AND ANALYSIS OF APPROXIMATION ALGORITHMS
|
| By: |
Ding-Zhu Du, Ker-I Ko, Xiaodong Hu |
| Format: |
Hardback |
| List price:
|
£69.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
1461417007 |
| ISBN 13: |
9781461417002 |
| Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
| Pub. date: |
17 November, 2011 |
| Edition: |
2012 |
| Series: |
Springer Optimization and Its Applications 62 |
| Pages: |
440 |
| Description: |
Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. This allows the reader to study approximation algorithms of the same nature together. |
| Synopsis: |
This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. |
| Illustrations: |
XII, 440 p. |
| Publication: |
US |
| Imprint: |
Springer-Verlag New York Inc. |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|