Paradigms for fast parallel approximability

Paradigms for fast parallel approximability

Josep Díaz, Maria Serna, Paul Spirakis, Jacobo Torán
이 책이 얼마나 마음에 드셨습니까?
파일의 품질이 어떻습니까?
책의 품질을 평가하시려면 책을 다운로드하시기 바랍니다
다운로드된 파일들의 품질이 어떻습니까?
This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems, such as flows, coverings, matchings, traveling salesman problems, and graphs. For added clarity, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is rounded off by an appendix that gives a convenient summary of the problems described in the book. This book is an up-to-date reference for research workers in the area of algorithms and for graduate courses in the subject.
카테고리:
년:
1997
출판사:
CUP
언어:
english
페이지:
167
ISBN 10:
0521431700
ISBN 13:
9780521431705
시리즈:
Cambridge International Series on Parallel Computation
파일:
DJVU, 1012 KB
IPFS:
CID , CID Blake2b
english, 1997
온라인으로 읽기
로의 변환이 실행 중입니다
로의 변환이 실패되었습니다

주로 사용되는 용어