Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)

• An O(\log^*n) approximation algorithm for the asymmetric p-center problem
  Sundar Vishwanathan
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 1-5
• An extension of the Lovász Local Lemma, and its applications to integer programming
  Aravind Srinivasan
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 6-15
• A better approximation algorithm for finding planar subgraphs
  Gruia Gȃlinescu, Cristina G. Fernandes, Ulrich Finkler, Howard Karloff
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 16-25
• Improving biconnectivity approximation via local optimization
  Ka Wong Chong, Tak Wah Lam
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 26-35
• Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
  Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 36-41
• Time and space efficient method-lookup for object-oriented programs
  S. Muthukrishnan, Martin Müller
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 42-51
• Worst-case efficient priority queues
  Gerth Stlting Brodal
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 52-58
• On RAM priority queues
  Mikkel Thorup
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 59-67
• On-line generalized Steiner problem
  Baruch Awerbuch, Yossi Azar, Yair Bartal
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 68-74
• Randomized robot navigation alorithms
  Piotr Berman, Avrim Blum, Amos Fiat, Howard Karloff, Adi Rosén, Michael Saks
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 75-84
• Scheduling with conflicts, and applications to traffic signal control
  Sandy Irani, Vitus Leung
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 85-94
• Multiprocessor scheduling with rejection
  Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiȓí Sgall, Leen Stougie
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 95-103
• Polynomial-time solutions to image segmentation
  Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 104-113
• Optimal placement of convex polygons to maximize point containment
  Matthew Dickerson, Daniel Scharstein
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 114-121
• Efficient generation of k-directional assembly sequences
  Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 122-131
• Fixed-dimensional parallel linear programming via relative \epsilon-approximations
  Michael T. Goodrich
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 132-141
• Scheduling to minimize average completion time: Off-line and on-line algorithms
  Leslie A. Hall, David B. Shmoys, Joel Wein
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 142-151
• An improvrd approximation ratio for the minimum latency problem
  Michel Goemans, Jon Kleinberg
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 152-158
• Preemptive scheduling of parallel jobs on multiprocessors
  Xiaotie Deng, Nian Gu, Tim Brecht, KaiCheng Lu
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 159-167
• Tiling a figure using a height in a tree
  Eric Rémila
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 168-174
• The complexity of flat origami
  Marshall Bern, Barry Hayes
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 175-183
• Electrostatic fields without singularities: Theory and algorithms
  Marco Pellegrini
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 184-191
• An empirical study of dynamic graph algorithms
  David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 192-201
• Isomorphism testing and display of symmetries in dynamic trees
  Siu-Wing Cheng, Moon-Pun Ng
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 202-211
• Fully dynamic output bounded single source shortest path problem
  Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
  Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996), 1996, pp. 212-221