算法设计

算法设计
分享
扫描下方二维码分享到微信
打开微信,点击右上角”+“,
使用”扫一扫“即可将网页分享到朋友圈。
作者: [美] (Jon Kleinberg) , [美] (Eva Tardos)
2006-01
版次: 1
ISBN: 9787302122609
定价: 89.00
装帧: 平装
开本: 16开
纸张: 胶版纸
页数: 838页
正文语种: 简体中文
原版书名: Algorithm Design
124人买过
  •   《大学计算机教育国外著名教材系列:算法设计(影印版)》是近年来关于算法设计和分析的不可多得的优秀教材。《大学计算机教育国外著名教材系列:算法设计(影印版)》围绕算法设计技术组织素材,对每种算法技术选择了多个典型范例进行分析。本书将直观性与严谨性完美地结合起来。每章从实际问题出发,经过具体、深入、细致的分析,自然且富有启发性地引出相应的算法设计思想,并对算法的正确性、复杂性进行恰当的分析、论证。本书覆盖的面较宽,凡属串行算法的经典论题都有涉及,并且论述深入有新意。全书共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
查看详情
相关图书 / 更多
算法设计
算法构建论文层次学科分类体系的应用研究
耿海英
算法设计
算法分析与设计实践
王小明
算法设计
算法详解(卷4)——NP-Hard问题算法
[美]蒂姆·拉夫加登(Tim Roughgarden)
算法设计
算法设计方法与优化(第2版)
滕国文;滕泰
算法设计
算法详解 卷3 贪心算法和动态规划
[美]蒂姆·拉夫加登(Tim Roughgarden)
算法设计
算法与数据结构(C++语言版)(第2版)
冯广慧
算法设计
算法分析与设计
李少芳;卓明秀
算法设计
算法设计与分析基础(Java版)(微课视频版)
李春葆;刘娟;喻丹丹
算法设计
算法设计与分析基础(C++版)(微课视频版)
李春葆;陈良臣;喻丹丹
算法设计
算法社会:技术、权力和知识(法律与科技译丛)
马克·舒伦伯格(Marc Schuilenburg)
算法设计
算法设计实例教程
雷小宇
算法设计
算法设计与分析基础(Java版)学习与上机实验指导
李春葆;刘娟;喻丹丹
您可能感兴趣 / 更多
算法设计
宇宙视觉史:从宇宙大爆炸到时间的尽头
[美]查尔斯·刘 著;高爽 译者;[美]马克西姆· 马洛维奇科 绘;未读 出品
算法设计
写出我心 普通人如何通过写作表达自己(平装本)
[美]娜塔莉·戈德堡(Natalie Goldberg)
算法设计
写出我心3 写作疗愈的真正秘密
[美]娜塔莉·戈德堡(Natalie Goldberg)
算法设计
神套路:为什么我们总被带节奏(狂热与网红时代醍醐灌顶之作,教给普通人安身立命的不二法门!)
[美]阿里·阿莫萨维 著;[哥伦比亚]亚历杭德罗·希拉尔多 绘
算法设计
阿伦森自传
[美]埃利奥特·阿伦森(Elliot Aronson) 著;沈捷 译;湛庐文化 出品
算法设计
街头官僚:公共服务中的个人困境
[美]迈克尔·李普斯基(Michael Lipsky)
算法设计
史前至蒙古帝国时期的内欧亚大陆史
[美]大卫·克里斯蒂安 著;潘玲 译;杨建华 校
算法设计
意大利文艺复兴新艺术史
[美]迈克尔·韦恩·科尔 著;[美]斯蒂芬·J·坎贝尔;邵亦杨
算法设计
老人与海 彩图注音版 一二三四年级5-6-7-8-9岁小学生课外阅读经典 儿童文学无障碍有声伴读世界名著童话故事
[美]海明威
算法设计
养育的觉醒:全面激发孩子自驱力,教你如何心平气和做妈妈
[美]凯文·莱曼 著;唐晓璐 译;斯坦威 出品
算法设计
自律我也能做到(全9册)
[美]康妮·科维尔·米勒 著;[阿根廷]维多利亚·阿萨纳利 绘
算法设计
你在等什么?
[美]斯科特·明钦 著;[中]易万 译;[美]马特 ·斐兰 绘