ホームページ洋書在庫を掲載していますのでご利用ください。 洋書データベースもご覧下さい。
◆表示価格は為替変動により変わることもあります。このご案内の登録日より時間がたって価格が変わる
 場合は、注文者に確認のメールをお送りします。


Fiala, J. et al. ed.
Combinatorial Algorithms

Springer-Verlag 2009.11
480 pp.(P)
ISBN 3-642-10216-6
                            9,900円
20th International Workshop, IWOCA 2009, Hradec nad Moravici, Czech Republic, June 28--July 2, 2009, Revised Selected Papers
Contents
* This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicテュ, Czech Republic.

* The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics. *


Dobrushkin, V. A.
Methods in Algorithmic Analysis

Chapman & Hall/ CRC, USA 2009.11
824 pp.(H)
ISBN 1-4200-6829-6
                            9,700円

Contents
1. Preliminaries/ 2. Combinatorics/ 3. Probability/ 4. More about Probability/ 5. Recurrences or Difference Equations/ 6. Introduction to Generating Functions/ 7. Enumeration with Generating Functions/ 8. Further Enumeration Methods/ 9. Combinatorics of Strings/ 10. Introduction to Asymptotics/ 11. Asymptotics and Generating Functions/ 12. Review of Analytic Techniques/ Appendices/ Bibliography/ Answers/Hints to Selected Problems/ Index/ *


Kotsireas, I. S. & Zima, E. V. ed.
Advances in Combinatorial Mathematics

Springer-Verlag 2009.10
176 pp.(H)
ISBN 3-642-03561-2
                            15,400円
Proceedings of the Waterloo Workshop in Computer Algebra 2008
Contents
1. Method of Coefficients: an algebraic characterization and recent applications/ 2. PartitionsWith Distinct Evens/ 3. A Factorization Theorem for Classical Group Characters, with Applications to Plane Partitions and Rhombus Tilings/ 4. On Multivariate Newton(like) Inequalities/ 5. Niceness Theorems/ 6. Method of Generating Differentials/ 7. Henricis Friendly Monster Identity Revisited/ 8. The Automatic Central Limit Theorems Generator (and Much More!)/ Index/ *


Du, D.- Z. et al. ed.
Combinatorial Optimization and Applications
組合せ最適化と応用
Springer-Verlag 2009.
542 pp.(P)
ISBN 3-642-02025-9
                            12,200円
Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings
Contents
* This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.

* The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting. *


Demetrescu, C. et al. ed.
The Shortest Path Problem
Ninth DIMACS Implementation Challenge
(最短経路問題)

AMS 2009.8
319 pp.(H)
ISBN 0-8218-4383-4
                            15,400円

Contents
1.Real-World Applications of Shortest Path Algorithms/ 2.An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags/ 3.Fast Point-to-Point Shortest Path Computations with Arc-Flags/ 4.High-Performance Multi-Level Routing/ 5.Reach for A: Shortest Path Algorithms with Preprocessing/ 6.Highway Hierarchies Star/ 7.Ultrafast Shortest-Path Queries via Transit Nodes/ 8.Robust, Almost Constant Time Shortest-Path Queries in Road Networks/ 9.Single-Source Shortest Paths with the Parallel Boost Graph Library/ 10.Parallel Shortest Path Algorithms for Solving Large-Scale Instances/ 11.Breadth First Search on Massive Graphs/ 12.Engineering Label-Constrained Shortest-Path Algorithms/ Index/

* hortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. *
928-17                                 登録日 10.04.25


タイトル
税込価格
公費
注文冊数
私費
注文冊数
Combinatorial Algorithms
ISBN 3-642-10216-6
9,900円
Methods in Algorithmic Analysis
ISBN 1-4200-6829-6
9,700円
Advances in Combinatorial Mathematics
ISBN 3-642-03561-2
15,400円
Combinatorial Optimization and Applications
ISBN 3-642-02025-9
12,200円
The Shortest Path Problem
ISBN 0-8218-4383-4
15,400円
(928-17)
<お届け先>
 郵便番号
ご住所
ご氏名
お電話
メールアドレス
通信欄

◆表示価格は為替変動により変わることもあります。その場合はご連絡いたします

           亀田ブックサービス 行