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 MR95 and System Sciences, 20:18-31, 1980. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995. MRRT53 N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, and A. H. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087-1092, June 1953. MS91 MS93 B. Moret and H. Shapiro. Algorithm from P to NP: Design and Efficiency. Benjamin/Cummings, Redwood City, CA, 1991. M. Murphy and S. Skiena. Ranger: A tool for nearest neighbor search in high dimensions. In Proc. Ninth ACM Symposium on Computational Geometry, pages 403-404, 1993. MS95a D. Margaritis and S. Skiena. Reconstructing strings from substrings in rounds. Proc. 36th IEEE Symp. Foundations of Computer Science (FOCS), 1995. MS95b J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl., 5:95-114, 1995. MT85 MT87 S. Martello and P. Toth. A program for the 0-1 multiple knapsack problem. ACM Trans. Math. Softw., 11(2):135-140, June 1985. S. Martello and P. Toth. Algorithms for knapsack problems. In S. Martello, editor, Surveys in Combinatorial Optimization, volume 31 of Annals of Discrete Mathematics, pages 213-258. North- Holland, 1987. MT90a S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. Wiley, New York, 1990. MT90b K. Mehlhorn and A. Tsakalidis. Data structures. In J. van Leeuwen, editor, Handbook of file:///E|/BOOK/BOOK5/NODE232.HTM (35 of 50) [19/1/2003 1:28:02]

References Theoretical Computer Science: Algorithms and Complexity, volume A, pages 301-341. MIT Press, 1990. Mul94 K. Mulmuley. Computational Geometry: an introduction through randomized algorithms. Prentice- Hall, New York, 1994. MV80 S. Micali and V. Vazirani. An O algorithm for finding maximum matchings in general graphs. In Proc. 21st. Symp. Foundations of Computing, pages 17-27, 1980. MW93 J. More and S. Wright. Optimization Software Guide. SIAM, Philadelphia PA, 1993. Mye86 E. Myers. An O(n d) difference algorithm and its variations. Algorithmica, 1:514-534, 1986. NC88 NH93 NU95 T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. North-Holland, Amsterdam, 1988. J. Nievergelt and K. Hinrichs. Algorithms and Data Structures with applications to graphics and geometry. Prentice Hall, Englewood Cliffs NJ, 1993. Stefan Näher and C. Uhrig. The LEDA user manual, version r3.2. Available by ftp from ftp.mpisb.mpg.de in directory /pub/LEDA, 1995. NW78 A. Nijenhuis and H. Wilf. Combinatorial Algorithms for Computers and Calculators. Academic Press, Orlando FL, second edition, 1978. NW86 J. C. Nash and R. L. C. Wang. Subroutines for testing programs that compute the generalized inverse of a matrix. ACM Trans. Math. Softw., 12(3):274-277, September 1986. NZ80 I. Niven and H. Zuckerman. An Introduction to the Theory of Numbers. Wiley, New York, fourth edition, 1980. file:///E|/BOOK/BOOK5/NODE232.HTM (36 of 50) [19/1/2003 1:28:02]

References<br />

<strong>The</strong>oretical Computer Science: <strong>Algorithm</strong>s and Complexity, volume A, pages 301-341. MIT Press,<br />

1990.<br />

Mul94<br />

K. Mulmuley. Computational Geometry: an introduction through randomized algorithms. Prentice-<br />

Hall, New York, 1994.<br />

MV80<br />

S. Micali and V. Vazirani. An O algorithm for finding maximum matchings in general<br />

graphs. In Proc. 21st. Symp. Foundations of Computing, pages 17-27, 1980.<br />

MW93<br />

J. More and S. Wright. Optimization Software Guide. SIAM, Philadelphia PA, 1993.<br />

Mye86<br />

E. Myers. An O(n d) difference algorithm and its variations. <strong>Algorithm</strong>ica, 1:514-534, 1986.<br />

NC88<br />

NH93<br />

NU95<br />

T. Nishizeki and N. Chiba. Planar Graphs: <strong>The</strong>ory and <strong>Algorithm</strong>s. North-Holland, Amsterdam,<br />

1988.<br />

J. Nievergelt and K. Hinrichs. <strong>Algorithm</strong>s and Data Structures with applications to graphics and<br />

geometry. Prentice Hall, Englewood Cliffs NJ, 1993.<br />

Stefan Näher and C. Uhrig. <strong>The</strong> LEDA user manual, version r3.2. Available by ftp from ftp.mpisb.mpg.de<br />

in directory /pub/LEDA, 1995.<br />

NW78<br />

A. Nijenhuis and H. Wilf. Combinatorial <strong>Algorithm</strong>s for Computers and Calculators. Academic<br />

Press, Orlando FL, second edition, 1978.<br />

NW86<br />

J. C. Nash and R. L. C. Wang. Subroutines for testing programs that compute the generalized<br />

inverse of a matrix. ACM Trans. Math. Softw., 12(3):274-277, September 1986.<br />

NZ80<br />

I. Niven and H. Zuckerman. An Introduction to the <strong>The</strong>ory of Numbers. Wiley, New York, fourth<br />

edition, 1980.<br />

file:///E|/BOOK/BOOK5/NODE232.HTM (36 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!