|
Dòng
|
Nội dung
|
|
1
|
Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
Boston : PWS Pub. Co., 1997
596 p. ; 22 cm.
Ký hiệu phân loại (DDC): 511.42
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.
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
2
|
|
|
|
|
|