The.Algorithm.Design.Manual.Springer-Verlag.1998
Share Embed Flag
Download ePaper

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

omarfabiano
18.04.2013 Views

References Knu94 D. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM Press, New York, 1994. KO63 A. Karatsuba and Yu. Ofman. Multiplication of multi-digit numbers on automata. Sov. Phys. Dokl., 7:595-596, 1963. KOS91 A. Kaul, M. A. O'Connor, and V. Srinivasan. Computing Minkowski sums of regular polygons. In Proc. 3rd Canad. Conf. Comput. Geom., pages 74-77, 1991. Koz92 J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992. KPS89 B. Korte, H. Prömel, and A. Steger. Steiner trees in VLSI-layout. In B. Korte, L. Lovasz, H. Prömel, and A. Schrijver, editors, Paths, Flows, and VLSI-layout, pages 185-214. Springer- Verlag, Berlin, 1989. KR87 KR91 R. Karp and M. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Research and Development, 31:249-260, 1987. A. Kanevsky and V. Ramachandran. Improved algorithms for graph four-connectivity. J. Comp. Sys. Sci., 42:288-306, 1991. Kru56 J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. of the American Mathematical Society, 7:48-50, 1956. KS85 KS86 KS90 M. Keil and J. R. Sack. Computational Geometry, chapter Minimum decomposition of geometric objects, pages 197-216. North-Holland, 1985. D. Kirkpatrick and R. Siedel. The ultimate planar convex hull algorithm? SIAM J. Computing, 15:287-299, 1986. K. Kedem and M. Sharir. An efficient motion planning algorithm for a convex rigid polygonal file:///E|/BOOK/BOOK5/NODE232.HTM (29 of 50) [19/1/2003 1:28:02]

References object in 2-dimensional polygonal space. Discrete and Computational Geometry, 5:43-75, 1990. Kuh75 H. W. Kuhn. Steiner's problem revisited. In G. Dantzig and B. Eaves, editors, Studies in Optimization, pages 53-70. Mathematical Association of America, 1975. Kur30 K. Kuratowski. Sur le problème des courbes gauches en topologie. Fund. Math., 15:217-283, 1930. Kwa62 M. Kwan. Graphic programming using odd and even points. Chinese Math., 1:273-277, 1962. Lat91 J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991. Law76 E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, Fort Worth TX, 1976. Lee82 Lee94 Len87 D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Analysis and Machine Intelligence, PAMI-4:363-369, 1982. H. Leeb. pLab - a system for testing random numbers. In Proc. Int. Workshop Parallel Numerics, pages 89-99. Slovak Academy of Science, Institute for Informatics, Slovakia, 1994. Also available via ftp from http://random.mat.sbg.ac.at/ftp/pub/publications/leeb/smolenice/. T. Lengauer. Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. J. Algorithms, 8, 1987. Len89 T. Lengauer. Hierarchical planarity testing algorithms. J. ACM, 36(3):474-509, July 1989. Len90 Lev92 T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester, England, 1990. J. L. Leva. A normal random number generator. ACM Trans. Math. Softw., 18(4):454-455, December 1992. file:///E|/BOOK/BOOK5/NODE232.HTM (30 of 50) [19/1/2003 1:28:02]

References<br />

Knu94<br />

D. Knuth. <strong>The</strong> Stanford GraphBase: a platform for combinatorial computing. ACM Press, New<br />

York, 1994.<br />

KO63<br />

A. Karatsuba and Yu. Ofman. Multiplication of multi-digit numbers on automata. Sov. Phys. Dokl.,<br />

7:595-596, 1963.<br />

KOS91<br />

A. Kaul, M. A. O'Connor, and V. Srinivasan. Computing Minkowski sums of regular polygons. In<br />

Proc. 3rd Canad. Conf. Comput. Geom., pages 74-77, 1991.<br />

Koz92<br />

J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.<br />

KPS89<br />

B. Korte, H. Prömel, and A. Steger. Steiner trees in VLSI-layout. In B. Korte, L. Lovasz,<br />

H. Prömel, and A. Schrijver, editors, Paths, Flows, and VLSI-layout, pages 185-214. <strong>Springer</strong>-<br />

Verlag, Berlin, 1989.<br />

KR87<br />

KR91<br />

R. Karp and M. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Research and<br />

Development, 31:249-260, 1987.<br />

A. Kanevsky and V. Ramachandran. Improved algorithms for graph four-connectivity. J. Comp.<br />

Sys. Sci., 42:288-306, 1991.<br />

Kru56<br />

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem.<br />

Proc. of the American Mathematical Society, 7:48-50, 1956.<br />

KS85<br />

KS86<br />

KS90<br />

M. Keil and J. R. Sack. Computational Geometry, chapter Minimum decomposition of geometric<br />

objects, pages 197-216. North-Holland, 1985.<br />

D. Kirkpatrick and R. Siedel. <strong>The</strong> ultimate planar convex hull algorithm? SIAM J. Computing,<br />

15:287-299, 1986.<br />

K. Kedem and M. Sharir. An efficient motion planning algorithm for a convex rigid polygonal<br />

file:///E|/BOOK/BOOK5/NODE232.HTM (29 of 50) [19/1/2003 1:28:02]

logo

products

Resources

Company

Terms of service
Privacy policy
Cookie policy
Cookie settings
Imprint
Change language
Made with love in Switzerland
© 2024 Yumpu.com all rights reserved

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!