算法设计

算法设计
9.0
分享
扫描下方二维码分享到微信
打开微信,点击右上角”+“,
使用”扫一扫“即可将网页分享到朋友圈。
作者: [美] (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
查看详情
好书推荐 / 更多
算法设计
见证:肖斯塔科维奇回忆录
叶琼芳 译;[俄]季米特里·肖斯塔科维奇 口述;[美]所罗门·伏尔科夫 整理
算法设计
黄昏的诉说
德里克·沃尔科特 著;[圣卢西亚]德里克·沃尔科特 编;刘志刚 马绍博 译
算法设计
演化
[法]让-巴普蒂斯特·德·帕纳菲厄(Jean-Baptiste de Panafieu)、[法]帕特里克·格里斯(Patrick Gries) 著;邢路达、胡晗、王维 译;[法]帕特里克·格里斯(Patrick Gries) 摄影
算法设计
群星
七月 著
算法设计
罪与罚:学术评论版(文学纪念碑)
[俄]费奥多尔·陀思妥耶夫斯基 著;曹国维 译
算法设计
涉渡之舟:新时期中国女性写作与女性文化
戴锦华 著
算法设计
伯林传
[加拿大]叶礼庭 著;罗妍莉 译
算法设计
韩国文学丛书:你的夏天还好吗?
[韩]金爱烂 著;薛舟 译
算法设计
洛城机密:洛城四部曲之三
[美]詹姆斯·艾尔罗伊 著;姚向辉 译
算法设计
两全其美
[美]梅尔·梅洛 著;李思璟 译
算法设计
近代山区社会的习惯、契约和权利——龙泉司法档案的社会史研究
杜正贞 著
算法设计
风雨鸡鸣:变动时代的读书人
罗志田 著