Suche Bilder Maps Play YouTube News Gmail Drive Mehr »
Anmelden
Books Bücher 1 - 9 von 9 in Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications.
" Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. "
Approximation Algorithms - Seite 358
von Vijay V. Vazirani - 2002 - 380 Seiten
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Howard Karloff - 1998 - 704 Seiten
...Proceedings of the 29th Линии' A CM Symposium on Theory of Computing, pages 485495, May 1997. [4] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184 193, October...
Eingeschränkte Leseprobe - Über dieses Buch

Online Computation and Competitive Analysis

Allan Borodin, Ran El-Yaniv - 2005 - 414 Seiten
...conjucture: Simplification of Koutsoupias-Papadimitriou proof, 1 996. Unpublished manuscript. [43] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 1 84-193, 19%. [44]...
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms

SIAM Activity Group on Discrete Mathematics - 2001 - 937 Seiten
...Acknowledgments We thank Olga Veksler and Mihalis Yannakakis for useful discussions. References [1] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, October...
Eingeschränkte Leseprobe - Über dieses Buch

Lectures on Discrete Geometry

...Proc. 34th IEEE Symposium on Foundations of Computer Science, pages 566-572, 1993. (ref: p. 24) [Bar96] Y. Bartal. Probabilistic approximation of metric spaces...and its algorithmic applications. In Proc. 37th IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996. (ref: p. 398) [Bar97] AI Barvinok....
Eingeschränkte Leseprobe - Über dieses Buch

Mathematical Foundations of Computer Science 2002: 27th International ...

Krzystof Diks - 2002 - 652 Seiten
...partitions. In 31st IEEE Symp. on Foundations of Computer Science, pages 503-513, October 1990. 7. Y. Bartal. Probabilistic approximation of metric spaces...and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 184-193, 1996. 8. Y. Bartal. On approximating arbitrary...
Eingeschränkte Leseprobe - Über dieses Buch

Handbook of Discrete and Computational Geometry, Second Edition

Csaba D. Toth, Joseph O'Rourke, Jacob E. Goodman - 2004 - 1560 Seiten
...complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58:137-147. 1999. [Bar96] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci.. pages 184-193. 1996. [Bar98] Y. Bartal. On approximating arbitrary...
Eingeschränkte Leseprobe - Über dieses Buch

Spanning Trees and Optimization Problems

Bang Ye Wu, Kun-Mao Chao - 2004 - 200 Seiten
...Verlag. 1994. [7] HJ Bandelt. Recognition of tree metrics. SIAM J. Discrete Math, 3(l):l-6, 1990. [8] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996....
Eingeschränkte Leseprobe - Über dieses Buch

Representations for Genetic and Evolutionary Algorithms

Franz Rothlauf - 2006 - 325 Seiten
...Congress on Evolutionary Computation CEC01, Piscataway, NJ, pp. 30-37. IEEE Press. Bartal, Y. (1996). Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 184-193. Bartal, Y. (1998). On approximating arbitrary...
Eingeschränkte Leseprobe - Über dieses Buch

Theory and Applications of Models of Computation: 5th International ...

Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li - 2008 - 598 Seiten
...time algorithm could be useful in practice and is of theoretical interest. References 1. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proc. 37th FOCS, pp. 184-193 (1996) 2. Bonizzoni, P., Vedova, GD: The complexity of multiple sequence alignment...
Eingeschränkte Leseprobe - Über dieses Buch




  1. Meine Bücher
  2. Hilfe
  3. Erweiterte Buchsuche