Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Technology can be most broadly defined as the entities, both material and immaterial, created by the application of mental and physical effort in order to achieve some value. In this usage, technology refers to tools and machines that may be used to solve real-world problems. It is a far-reaching term that may include simple tools, such as a crowbar or wooden spoon, or more complex machines, such as a space station or particle accelerator. Tools and machines need not be material; virtual technology, such as computer software and business methods, fall under this definition of technology.[10]. | David P. Williamson David B.yhmoys Copyright 2010 by David P. Williamson and David B. Shmoys. All rights reserved. To be published by Cambridge University Press. 2 This electronic-only manuscript is published on www.designofapproxalgs.com with the permission of Cambridge University Press. One copy per user may be taken for personal use only and any other use you wish to make of the work is subject to the permission of Cambridge University Press rights@cambridge.org . You may not post this file on any other website. Electronic web edition. Copyright 2011 by David P. Williamson and David B. Shmoys. To be published by Cambridge University Press Preface This book is designed to be a textbook for graduate-level courses in approximation algorithms. After some experience teaching minicourses in the area in the mid-1990s we sat down and wrote out an outline of the book. Then one of us DPW who was at the time an IBM Research Staff Member taught several iterations of the course following the outline we had devised in Columbia University s Department of Industrial Engineering and Operations Research in Spring 1998 in Cornell University s School of Operations Research and Industrial Engineering in Fall 1998 and at the Massachusetts Institute of Technology s Laboratory for Computer Science in Spring 2000. The lecture notes from these courses were made available and we got enough positive feedback on them from students and from professors teaching such courses elsewhere that we felt we were on the right track. Since then there have been many exciting developments in the area and we have added many of them to the book we taught additional iterations of the course at Cornell in Fall 2006 and Fall 2009 in order to field test some of the writing of the newer results. The courses were developed for students who have already had a class undergraduate or graduate in algorithms and who were comfortable with the idea of mathematical proofs about the correctness of algorithms. The book .
