算法设计

算法设计
分享
扫描下方二维码分享到微信
打开微信,点击右上角”+“,
使用”扫一扫“即可将网页分享到朋友圈。
作者: [美] (Jon Kleinberg) , [美] (Eva Tardos)
2006-01
版次: 1
ISBN: 9787302122609
定价: 89.00
装帧: 平装
开本: 16开
纸张: 胶版纸
页数: 838页
正文语种: 简体中文
原版书名: Algorithm Design
  •   《大学计算机教育国外著名教材系列:算法设计(影印版)》是近年来关于算法设计和分析的不可多得的优秀教材。《大学计算机教育国外著名教材系列:算法设计(影印版)》围绕算法设计技术组织素材,对每种算法技术选择了多个典型范例进行分析。本书将直观性与严谨性完美地结合起来。每章从实际问题出发,经过具体、深入、细致的分析,自然且富有启发性地引出相应的算法设计思想,并对算法的正确性、复杂性进行恰当的分析、论证。本书覆盖的面较宽,凡属串行算法的经典论题都有涉及,并且论述深入有新意。全书共200多道丰富而精彩的习题是本书的重要组成部分,也是本书的突出特色之一。
      本书适用于本科高年级学生以及研究生算法课的教材,也很适于具有计算机或相近专业本科水平的人自学算法的需要。   JonKleinbergisaprofessorofComputerScienceatCornellUniversity.HereceivedhisPh.D.fromM.I.T.in1996.HeistherecipientofanNSFCareerAward,anONRYoungInvestigatorAward,anIBMOutstand-ingInnovationAward,theNationalAcademyofSci-encesAwardforInitiativesinResearch,researchfel-lowshipsfromthePackardandSloanFoundations,andteachingawardsfromtheCornellEngineeringCollegeandComputerScienceDepartment.
      Kleinberg'sresearchiscenteredaroundalgorithms,particularlythosecon-cernedwiththestructureofnetworksandinformation,andwithapplicationstoinformationscience,optimization,datamining,andcomputationalbiol-ogy.HisworkonnetworkanalysisusinghubsandauthoritieshelpedformthefoundationforthecurrentgenerationofInternetsearchengines.EvaTardosisaprofessorofComputerScienceatCor-nellUniversity.ShereceivedherPh.D.fromEotvosUniversityinBudapest,Hungaryin1984.SheisamemberoftheAmericanAcademyofArtsandSci-ences,andanACMFellow;sheistherecipientofanNSFPresidentialYoungInvestigatorAward,theFulk-ersonPrize,researchfellowshipsfromtheGuggen-heim,Packard,andSloanFoundations,andteach-ingawardsfromtheCornellEngineenngCollegeandComputerScienceDepartment.Tardos'sresearchinterestsarefocusedonthedesignandanalysisofalgorithmsforproblemsongraphsornetworks.Sheismostknownforherworkonnetwork-flowalgorithmsandapproximationalgorithmsfornetworkproblems.Herrecentworkfocusesonalgorithmicgametheory,anemergingareaconcernedwithdesigningsystemsandalgorithmsforselfishusers. AbouttheAuthors
    Preface
    1Introduction:SomeRepresentativeProblems
    1.1AFirstProblem:StableMatching
    1.2FiveRepresentativeProblems
    SolvedExercises
    Exercises
    NotesandFurtherReading

    2BasicsofAlgorithmAnalysis
    2.1ComputationalTractability
    2.2AsymptoticOrderofGrowth
    2.3ImplementingtheStableMatchingAlgorithmUsingListsandArrays
    2.4ASurveyofCommonRunningTimes
    2.5AMoreComplexDataStructure:PriorityQueues
    SolvedExercises
    Exercises
    NotesandFurtherReading

    3Graphs
    3.1BasicDefinitionsandApplications
    3.2GraphConnectivityandGraphTraversal
    3.3ImplementingGraphTraversalUsingQueuesandStacks
    3.4TestingBipaniteness:AnApplicationofBreadth-FirstSearch
    3.5ConnectivityinDirectedGraphs
    3.6DirectedAcyclicGraphsandTopologicalOrdering
    SolvedExercises
    Exercises
    NotesandFurtherReading

    4GreedyAlgorithms
    4.1IntervalScheduling:TheGreedyAlgorithmStaysAhead
    4.2SchedulingtoMinimizeLateness:AnExchangeArgument
    4.3OptimalCaching:AMoreComplexExchangeArgument
    4.4ShortestPathsinaGraph
    4.5TheMinimumSpanningTreeProblem
    4.6ImplementingKruskal'sAlgorithm:TheUnion-FindDataStructure
    4.7Clustering
    4.8HuffmanCodesandDataCompression
    *4.9Minimum-CostArborescences:AMulti-PhaseGreedyAlgorithm
    SolvedExercises
    Exercises
    NotesandFurtherReading

    5DivideandCornquer
    5.1AFirstRecurrence:TheMergesortAlgorithm
    5.2FurtherRecurrenceRelations
    5.3CountingInversions
    5.4FindingtheClosestPairofPoints
    5.5IntegerMultiplication
    5.6ConvolutionsandtheFastFourierTransform
    SolvedExercises
    Exercises
    NotesandFurtherReading

    6DynamicProgramming
    6.1WeightedIntervalScheduling:ARecursiveProcedure
    6.2PrinciplesofDynamicProgramming:MemoizationorIterationoverSubproblems
    6.3SegmentedLeastSquares:Multi-wayChoices
    ……

    7NetworkFlow
    8NPandComputationalIntractability
    9PSPACE:AClassofProblemsbeyondNP
    10ExtendingtheLimitsofTractability
    11ApproximationAlgorithms
    12LocalSearch
    13RandomizedAlgorithms
    Epilogue:AlgorithmsThatRunForever
    References
    Index
  • 内容简介:
      《大学计算机教育国外著名教材系列:算法设计(影印版)》是近年来关于算法设计和分析的不可多得的优秀教材。《大学计算机教育国外著名教材系列:算法设计(影印版)》围绕算法设计技术组织素材,对每种算法技术选择了多个典型范例进行分析。本书将直观性与严谨性完美地结合起来。每章从实际问题出发,经过具体、深入、细致的分析,自然且富有启发性地引出相应的算法设计思想,并对算法的正确性、复杂性进行恰当的分析、论证。本书覆盖的面较宽,凡属串行算法的经典论题都有涉及,并且论述深入有新意。全书共200多道丰富而精彩的习题是本书的重要组成部分,也是本书的突出特色之一。
      本书适用于本科高年级学生以及研究生算法课的教材,也很适于具有计算机或相近专业本科水平的人自学算法的需要。
  • 作者简介:
      JonKleinbergisaprofessorofComputerScienceatCornellUniversity.HereceivedhisPh.D.fromM.I.T.in1996.HeistherecipientofanNSFCareerAward,anONRYoungInvestigatorAward,anIBMOutstand-ingInnovationAward,theNationalAcademyofSci-encesAwardforInitiativesinResearch,researchfel-lowshipsfromthePackardandSloanFoundations,andteachingawardsfromtheCornellEngineeringCollegeandComputerScienceDepartment.
      Kleinberg'sresearchiscenteredaroundalgorithms,particularlythosecon-cernedwiththestructureofnetworksandinformation,andwithapplicationstoinformationscience,optimization,datamining,andcomputationalbiol-ogy.HisworkonnetworkanalysisusinghubsandauthoritieshelpedformthefoundationforthecurrentgenerationofInternetsearchengines.EvaTardosisaprofessorofComputerScienceatCor-nellUniversity.ShereceivedherPh.D.fromEotvosUniversityinBudapest,Hungaryin1984.SheisamemberoftheAmericanAcademyofArtsandSci-ences,andanACMFellow;sheistherecipientofanNSFPresidentialYoungInvestigatorAward,theFulk-ersonPrize,researchfellowshipsfromtheGuggen-heim,Packard,andSloanFoundations,andteach-ingawardsfromtheCornellEngineenngCollegeandComputerScienceDepartment.Tardos'sresearchinterestsarefocusedonthedesignandanalysisofalgorithmsforproblemsongraphsornetworks.Sheismostknownforherworkonnetwork-flowalgorithmsandapproximationalgorithmsfornetworkproblems.Herrecentworkfocusesonalgorithmicgametheory,anemergingareaconcernedwithdesigningsystemsandalgorithmsforselfishusers.
  • 目录:
    AbouttheAuthors
    Preface
    1Introduction:SomeRepresentativeProblems
    1.1AFirstProblem:StableMatching
    1.2FiveRepresentativeProblems
    SolvedExercises
    Exercises
    NotesandFurtherReading

    2BasicsofAlgorithmAnalysis
    2.1ComputationalTractability
    2.2AsymptoticOrderofGrowth
    2.3ImplementingtheStableMatchingAlgorithmUsingListsandArrays
    2.4ASurveyofCommonRunningTimes
    2.5AMoreComplexDataStructure:PriorityQueues
    SolvedExercises
    Exercises
    NotesandFurtherReading

    3Graphs
    3.1BasicDefinitionsandApplications
    3.2GraphConnectivityandGraphTraversal
    3.3ImplementingGraphTraversalUsingQueuesandStacks
    3.4TestingBipaniteness:AnApplicationofBreadth-FirstSearch
    3.5ConnectivityinDirectedGraphs
    3.6DirectedAcyclicGraphsandTopologicalOrdering
    SolvedExercises
    Exercises
    NotesandFurtherReading

    4GreedyAlgorithms
    4.1IntervalScheduling:TheGreedyAlgorithmStaysAhead
    4.2SchedulingtoMinimizeLateness:AnExchangeArgument
    4.3OptimalCaching:AMoreComplexExchangeArgument
    4.4ShortestPathsinaGraph
    4.5TheMinimumSpanningTreeProblem
    4.6ImplementingKruskal'sAlgorithm:TheUnion-FindDataStructure
    4.7Clustering
    4.8HuffmanCodesandDataCompression
    *4.9Minimum-CostArborescences:AMulti-PhaseGreedyAlgorithm
    SolvedExercises
    Exercises
    NotesandFurtherReading

    5DivideandCornquer
    5.1AFirstRecurrence:TheMergesortAlgorithm
    5.2FurtherRecurrenceRelations
    5.3CountingInversions
    5.4FindingtheClosestPairofPoints
    5.5IntegerMultiplication
    5.6ConvolutionsandtheFastFourierTransform
    SolvedExercises
    Exercises
    NotesandFurtherReading

    6DynamicProgramming
    6.1WeightedIntervalScheduling:ARecursiveProcedure
    6.2PrinciplesofDynamicProgramming:MemoizationorIterationoverSubproblems
    6.3SegmentedLeastSquares:Multi-wayChoices
    ……

    7NetworkFlow
    8NPandComputationalIntractability
    9PSPACE:AClassofProblemsbeyondNP
    10ExtendingtheLimitsofTractability
    11ApproximationAlgorithms
    12LocalSearch
    13RandomizedAlgorithms
    Epilogue:AlgorithmsThatRunForever
    References
    Index
查看详情
12
相关图书 / 更多
算法设计
算法与数据结构
漆涛 著;漆涛 编
算法设计
算法设计与分析
张小东
算法设计
算法设计
[美]乔恩·克莱因伯格(Jon Kleinberg)
算法设计
算法竞赛入门经典——训练指南
刘汝佳 陈锋
算法设计
算法设计与分析(第4版)—微课视频版
吕国英;李茹;王文剑;曹付元;钱宇华;郭丽峰
算法设计
算法训练营:海量图解+竞赛刷题(进阶篇)
陈小玉
算法设计
算法竞赛入门经典——算法实现
陈锋
算法设计
算法设计基础与应用
杨中秋 编著;朱立军;杨威;肖明霞
算法设计
算法训练营:海量图解+竞赛刷题(入门篇)(博文视点出品) 
陈小玉 著
算法设计
算法详解(C++11语言描述)
日沉云起
算法设计
算法领导:如何比机器更优秀
迈克·沃尔什(Mike Walsh)
算法设计
算法设计与分析(大数据与人工智能技术丛书)
王秋芬 著
您可能感兴趣 / 更多
算法设计
哥伦比亚中国文学史(全8卷)(2版)
[美]梅维恒 编;马小悟、张治、刘文楠 译
算法设计
精神病院里的正常人
[美]苏珊娜•、卡哈兰(Susannah、Cahal 著
算法设计
论弗洛伊德的《女性气质》—国际精神分析协会《当代弗洛伊德转折点与重要议题》系列
[美]格拉谢拉·阿贝林-萨斯·罗斯(Graciela Abelin-Sas Rose) 编;[阿根廷]利蒂西娅·格洛瑟·菲奥里尼(Leticia Glocer Fiorini)、闪小春 译
算法设计
血流动力学监测
[美]迈克尔·R·平斯基 编;陈德昌、刘娇 译
算法设计
别让鸽子开巴士!(平装全6册):3-6岁习惯养成互动绘本爱心树童书
[美]莫•威廉斯 著;阿甲 译
算法设计
梦魇之书(普利策奖诗人高威·金奈尔首部中译本诗集,美国当代诗歌史上颇具震撼力的诗集之一。)
[美]高威·金奈尔 著;叶春 译
算法设计
探寻复杂问题中的关键X:公共卫生与医疗服务体系建模
[美]桑杰·巴苏(Sanjay Basu) 著;王力男、陈玉倩、徐嘉婕 译
算法设计
神奇动物救援队:海归小轮船/猴子卡车/小蓝象直升机(全3册)(麦克米伦世纪童书馆)
[美]迈克尔·斯莱克 著;张雪萌 译
算法设计
临渊而立(美国畅销书作家罗宾·科克代表作:潜回历史深处,揭开千年未解古埃及法老之谜。)
[美]罗宾·科克 著;孙致礼、宋佩铭 译
算法设计
通过解题学习代数几何
[美]托马斯.嘉里蒂 著
算法设计
美国伪狂犬病根除经历回顾
[美]美国农业部动植物检疫署 编;翟新验、张淼洁 译
算法设计
健康老年人的沟通与吞咽变化
[美]安吉拉·N.布尔达(Angela N.Burda) 著;曹宜璠、袁玉芹 译