Suche Bilder Maps Play YouTube News Gmail Drive Mehr »
Anmelden
Books Bücher 1 - 3 von 3 in S. Arora. Polynomial time approximation scheme for Euclidean TSP and other geometric...
" S. Arora. Polynomial time approximation scheme for Euclidean TSP and other geometric problems. In Proc. 37th IEEE Annual Symposium on Foundations of Computer Science, pages 2-11, 1996. (Cited on p. 89) 11. S. Arora. Nearly linear time approximation scheme... "
Approximation Algorithms - Seite 357
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
...Springer- Verlag, 1996. [15] M. Mitzenmacher. Load balancing and density dependent jump Markov processes. In Proc. 37th IEEE Annual Symposium on Foundations of Computer Science, pages 213-222, 1996. [16] PW Shor. The average-case analysis of some on-line algorithms for bin packing....
Eingeschränkte Leseprobe - Über dieses Buch

ECAI 2000: 14th European Conference on Artificial Intelligence, August 20-25 ...

Werner Horn - 2000 - 778 Seiten
...of predicting the peak of the hardness curve for an instance, a little sampling goes a long way. [1] S. Arora, 'Polynomial time approximation scheme for euclidean TSP and other geometric problems', in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS-96), pp. 2-11....
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
...Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sei. (1996), pp. 2-11. [2] S. Arora. Nearly linear time approximation scheme for Euclidean TSP and other geometric problems. In Proc. 38th Ann. IEEE Symp. on Foundations of Comput. Sei. (1997), pp. 554-563. [3] H. Bakoglu. Circuits,...
Eingeschränkte Leseprobe - Über dieses Buch




  1. Meine Mediathek
  2. Hilfe
  3. Erweiterte Buchsuche