
Approximation Algorithms for n-p Hard Problems
Dorit Hochbaum(Author)
Course Technology Inc (Publisher)
Published on 26. July 1996
Book
Hardback
464 pages
978-0-534-94968-6 (ISBN)
Description
Discussing approximation algorithms for n-p hard problems, this study details scheduling, connectivity problems, randomization in approximations, best possible results, and on-line and server problems.
More details
Language
English
Place of publication
Boston, MA
United States
Publishing group
Cengage Learning, Inc
Target group
College/higher education
Illustrations
Illustrations
Dimensions
Height: 248 mm
Width: 171 mm
Weight
975 gr
ISBN-13
978-0-534-94968-6 (9780534949686)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification