close
1.

電子ブック
ＥＢ
1. Algoritmi : Lo spirito dell’informatica
by David Harel, Yishai Feldman
出版情報: Milano : Springer-Verlag Italia, Milano, 2008
シリーズ名: Unitext ;
オンライン: http://dx.doi.org/10.1007/978-88-470-0580-8
所蔵情報: loading…
2.

電子ブック
ＥＢ
2. Computability of Julia Sets
by Mark Braverman, Michael Yampolsky ; edited by Arjeh M. Cohen, Henri Cohen, David Eisenbud, Michael F. Singer, Bernd Sturmfels
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009
シリーズ名: Algorithms and Computation in Mathematics ; 23
オンライン: http://dx.doi.org/10.1007/978-3-540-68547-0
所蔵情報: loading…
3.

電子ブック
ＥＢ
3. Algorithmic Randomness and Complexity. 1
by Rodney G. Downey, Denis R. Hirschfeldt
出版情報: New York, NY : Springer Science+Business Media, LLC, 2010
シリーズ名: Theory and Applications of Computability, In cooperation with the association Computability in Europe ;
オンライン: http://dx.doi.org/10.1007/978-0-387-68441-3
所蔵情報: loading…
4.

電子ブック
ＥＢ
4. Introduction to Combinatorial Optimization. 1st ed. 2022
by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2022
シリーズ名: Springer Optimization and Its Applications ; 196
オンライン: https://doi.org/10.1007/978-3-031-10596-8
所蔵情報: loading…
目次情報: 続きを見る
1. Introduction.-2. Divide-and-Conquer
3. Dynamic Programming and Shortest Path
4. Greedy Algorithm and Spanning Tree
5. Incremental Method and Maximum Network Flow
6. Linear Programming
7. Primal-Dual Methods and Minimum Cost Flow
8. NP-hard Problems and Approximation Algorithms
9. Restriction and Steiner Tree
10. Greedy Approximation and Submodular Optimization
11. Relaxation and Rounding. 12. Nonsubmodular Optimization
Bibliography
1. Introduction.-2. Divide-and-Conquer
3. Dynamic Programming and Shortest Path
4. Greedy Algorithm and Spanning Tree