9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings (Lecture Notes in Computer Science)
Edición de la obra Algorithms and Computation
| Autor | Kyung-Yong Chwa, Oscar H. Ibarra |
|---|---|
| Editorial | Springer |
| Fecha de publicación | December 10, 1998 |
| Idioma | inglés |
| Páginas | 478 |
| Formato | Paperback |
| ISBN-13 | 9783540653851 |
| ISBN-10 | 3540653856 |
| OCLC | 40609662 |
| Número de Cutter |
C564a |
Algorithms and Computation: 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings<br />Author: Kyung-Yong Chwa, Oscar H. Ibarra<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-65385-1<br /> DOI: 10.1007/3-540-49381-6<br /><br />Table of Contents:<p></p><ul><li>The Discrepancy Method </li><li>Implementing Algorithms and Data Structures: An Educational and Research Perspective </li><li>L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing </li><li>Facility Location on Terrains </li><li>Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles </li><li>Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words </li><li>Disjunctions of Horn Theories and Their Cores </li><li>Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It </li><li>Two-Layer Planarization in Graph Drawing </li><li>Computing Orthogonal Drawings in a Variable Embedding Setting </li><li>Dynamic Grid Embedding with Few Bends and Changes </li><li>Two New Families of List Update Algorithms </li><li>An Optimal Algorithm for On-Line Palletizing at Delivery Industry </li><li>On-Line Scheduling of Parallel Jobs with Runtime Restrictions </li><li>Testing the Quality of Manufactured Disks and Cylinders </li><li>Casting with Skewed Ejection Direction </li><li>Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image </li><li>k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph </li><li>Polyhedral Structure of Submodular and Posi-modular Systems </li><li>Maximizing the number of Connections in Optical Tree Networks</li></ul>