×

Algorithm engineering as a new paradigm. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, October 30–November 2, 2000. (English) Zbl 0989.90001

The articles of this volume will not be indexed individually.
Contents: Hironobu Aoki, Ryuhei Uehara and Koichi Yamazaki, Expected length of longest common subsequences of two biased random strings and its application (1-10); Yuichi Asahiro, Eric Chung-Hui Chang, Amol Mali, Syunsuke Nagafuji, Ichiro Suzuki and Masafumi Yamashita, Distributed motion generation for carrying a ladder by two omni-directional robots (11-17); Tetsuo Asano, Naoki Fujikawa, Naoki Katoh, Tomomi Matsui, Hiroshi Nagamochi, Takeshi Tokuyama and Nobuaki Usui, Digital halftoning: formulation as a combinatorial optimization problem and approximation algorithms based on network flow (18-27); Matthias Basken and Stefan Naher, A generic tool for interactive visualization of geometric algorithms (GeoWin) (28-35); Tamal K. Dey and Joachim Giesen, Detecting undersampling in surface reconstruction (36-52); Akihiro Fujiwara, Michiko Inoue and Toshimitsu Masuzawa, Cost optimal parallel algorithms for \(P\)-complete problems (53-62); James F. Geelen, An algebraic approach to matching problems (63-71); Han Hoogeveen, Martin Skutella and Gerhard J. Woeginger, Preemptive scheduling with rejection (72-80); Oscar H. Ibarra, Some complexity issues in parallel computing (81-89); Kazuo Iwama and Eiji Miyano, Towards an optimal oblivious routing algorithm on 2D meshes (90-99); Masashi Kiyomi and Tomomi Matsui, Integer programming based algorithms for peg solitaire problems (100-108); Kei Kobayashi and Kokichi Sugihara, Crystal Voronoi diagram and its applications (109-119); Shay Kutten, On time adaptivity and stabilization (120-129); Kazuhisa Makino and Tiko Kameda, Transformations on regular non-dominated coteries and their application (130-139); Shigeru Masuyama and Shin-ichi Nakayama, Some structural features of graphs which make efficient parallel algorithms possible (Japanese) (140-149); Kazuo Murota and Akiyoshi Shioura, Quasi \(M\)-convex functions and minimization algorithms (150-159); Shin-ichi Nakano and Makiko Yoshikawa, A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs (extended abstract) (160-168); Ibrahim H. Osman, Metaheuristics: a general framework (169-170); Celso C. Ribeiro, Eduardo Uchoa and Renato F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs (171); Wolfgang Slany, Nysret Musliu, Guy Kortsarz and Johannes Gartner, Theory and practice of shift scheduling (172-181); Mario Szegedy, CKit: a preprocessor for algorithmic experiments (182-190); Yasuhiko Takenaga, Recognition of ordered tree-shellable functions based on OBDDs (191-198); Satoshi Taoka and Toshimasa Watanabe, Efficient augmentation to construct \((\sigma+1)\)-edge-connected simple graphs (199-208); Ingo Wegener, On the design and analysis of evolutionary algorithms (209-220); David P. Williamson, A short primer on the primal-dual method for approximation algorithms (221-230).

MSC:

90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
00B25 Proceedings of conferences of miscellaneous specific interest
05C85 Graph algorithms (graph-theoretic aspects)
68Wxx Algorithms in computer science
90Cxx Mathematical programming

Software:

GeoWin
PDFBibTeX XMLCite