找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Design and Analysis of Approximation Algorithms; Ding-Zhu Du,Ker-I Ko,Xiaodong Hu Textbook 2012 Springer Science+Business Media, LLC 2012

[復(fù)制鏈接]
查看: 11216|回復(fù): 35
樓主
發(fā)表于 2025-3-21 18:47:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Design and Analysis of Approximation Algorithms
編輯Ding-Zhu Du,Ker-I Ko,Xiaodong Hu
視頻videohttp://file.papertrans.cn/269/268498/268498.mp4
概述The technique-oriented approach provides a unified view of the design techniques for approximation algorithms.Detailed algorithms, as well as complete proofs and analyses, are presented for each techn
叢書(shū)名稱Springer Optimization and Its Applications
圖書(shū)封面Titlebook: Design and Analysis of Approximation Algorithms;  Ding-Zhu Du,Ker-I Ko,Xiaodong Hu Textbook 2012 Springer Science+Business Media, LLC 2012
描述This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques
出版日期Textbook 2012
關(guān)鍵詞NP-completeness; approximation algorithms; combinatorial optimization; greedy algorithms; linear program
版次1
doihttps://doi.org/10.1007/978-1-4614-1701-9
isbn_softcover978-1-4899-9844-6
isbn_ebook978-1-4614-1701-9Series ISSN 1931-6828 Series E-ISSN 1931-6836
issn_series 1931-6828
copyrightSpringer Science+Business Media, LLC 2012
The information of publication is updating

書(shū)目名稱Design and Analysis of Approximation Algorithms影響因子(影響力)




書(shū)目名稱Design and Analysis of Approximation Algorithms影響因子(影響力)學(xué)科排名




書(shū)目名稱Design and Analysis of Approximation Algorithms網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Design and Analysis of Approximation Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Design and Analysis of Approximation Algorithms被引頻次




書(shū)目名稱Design and Analysis of Approximation Algorithms被引頻次學(xué)科排名




書(shū)目名稱Design and Analysis of Approximation Algorithms年度引用




書(shū)目名稱Design and Analysis of Approximation Algorithms年度引用學(xué)科排名




書(shū)目名稱Design and Analysis of Approximation Algorithms讀者反饋




書(shū)目名稱Design and Analysis of Approximation Algorithms讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:19:06 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:42:04 | 只看該作者
Textbook 2012r researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available
地板
發(fā)表于 2025-3-22 06:13:51 | 只看該作者
1931-6828 s complete proofs and analyses, are presented for each technThis book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and A
5#
發(fā)表于 2025-3-22 09:09:39 | 只看該作者
Ding-Zhu Du,Ker-I Ko,Xiaodong HuThe technique-oriented approach provides a unified view of the design techniques for approximation algorithms.Detailed algorithms, as well as complete proofs and analyses, are presented for each techn
6#
發(fā)表于 2025-3-22 14:49:29 | 只看該作者
Springer Optimization and Its Applicationshttp://image.papertrans.cn/d/image/268498.jpg
7#
發(fā)表于 2025-3-22 19:53:42 | 只看該作者
https://doi.org/10.1007/978-1-4614-1701-9NP-completeness; approximation algorithms; combinatorial optimization; greedy algorithms; linear program
8#
發(fā)表于 2025-3-23 00:55:23 | 只看該作者
9#
發(fā)表于 2025-3-23 05:23:33 | 只看該作者
Design and Analysis of Approximation Algorithms978-1-4614-1701-9Series ISSN 1931-6828 Series E-ISSN 1931-6836
10#
發(fā)表于 2025-3-23 05:32:54 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 05:15
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
威海市| 甘洛县| 郸城县| 高淳县| 高邮市| 简阳市| 沙河市| 玛沁县| 惠州市| 青河县| 荃湾区| 承德县| 望奎县| 理塘县| 来凤县| 乐业县| 丹江口市| 抚远县| 灵山县| 沅陵县| 湘阴县| 奉新县| 九江市| 鸡西市| 廊坊市| 潮安县| 赣州市| 鞍山市| 天等县| 鹰潭市| 建水县| 翁牛特旗| 桂平市| 河北省| 当涂县| 株洲市| 和龙市| 五原县| 三原县| 榆社县| 县级市|