Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum

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.

Lưu vào:
Hiển thị chi tiết
Tác giả chính: Hochbaum, Dorit S Editor
Đồng tác giả: Hochbaum, Dorit S  Editor
Định dạng: text
Ngôn ngữ:eng
Thông tin xuất bản: PWS Pub. Co.,
Chủ đề:
Truy cập trực tuyến:http://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/500 khoahoc/anhbiasach/25231_approximation algorithms for np-hard problemsthumbimage.jpg
http://elib.ntt.edu.vn/Opac/DmdInfo.aspx?dmd_id=25231
Từ khóa: Thêm từ khóa bạn đọc
Không có từ khóa, Hãy là người đầu tiên gắn từ khóa cho biểu ghi này!
id ntt-http:--elib.ntt.edu.vn-Opac-DmdInfo.aspx?dmd_id=25231
record_format dspace
spelling ntt-http:--elib.ntt.edu.vn-Opac-DmdInfo.aspx?dmd_id=252312020-10-27Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum Hochbaum, Dorit S EditorProgramming (Mathematics)Algorithms.Approximation theory.Khoa Công nghệ Thông tinDiscussing 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.Dự án VN Book DrivePWS Pub. Co., Hochbaum, Dorit S  EditorHochbaum, Dorit S  Editor1997texthttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/500 khoahoc/anhbiasach/25231_approximation algorithms for np-hard problemsthumbimage.jpg0534949681http://elib.ntt.edu.vn/Opac/DmdInfo.aspx?dmd_id=25231enghttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/500 khoahoc/anhbiasach/25231_approximation algorithms for np-hard problemsthumbimage.jpg 
institution Trường Đại học - Nguyễn Tất Thành
collection Kipos
language eng
topic Programming (Mathematics)
Algorithms.
Approximation theory.
Khoa Công nghệ Thông tin
spellingShingle Programming (Mathematics)
Algorithms.
Approximation theory.
Khoa Công nghệ Thông tin
Hochbaum, Dorit S Editor
Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
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.
author2 Hochbaum, Dorit S  Editor
author_facet Hochbaum, Dorit S  Editor
Hochbaum, Dorit S Editor
format text
author Hochbaum, Dorit S Editor
author_sort Hochbaum, Dorit S Editor
title Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
title_short Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
title_full Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
title_fullStr Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
title_full_unstemmed Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
title_sort approximation algorithms for np-hard problems / edited by dorit s hochbaum
publisher PWS Pub. Co.,
url http://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/500 khoahoc/anhbiasach/25231_approximation algorithms for np-hard problemsthumbimage.jpg
http://elib.ntt.edu.vn/Opac/DmdInfo.aspx?dmd_id=25231
work_keys_str_mv AT hochbaumdoritseditor approximationalgorithmsfornphardproblemseditedbydoritshochbaum
_version_ 1748826100952203264