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 CC92 S. Carlsson and J. Chen. The complexity of heaps. In Proc. Third ACM-SIAM Symp. on Discrete Algorithms, pages 393-402, 1992. CCDG82 P. Chinn, J. Chvátolvá, A. K. Dewdney, and N. E. Gibbs. The bandwidth problem for graphs and matrices - a survey. J. Graph Theory, 6:223-254, 1982. CD85 B. Chazelle and D. Dobkin. Optimal convex decompositions. In G. Toussaint, editor, Computational Geometry, pages 63-133. North-Holland, Amsterdam, 1985. CDT95 G. Carpento, M. Dell'Amico, and P. Toth. CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans. Math. Softw., 21(4):410-415, December 1995. CE92 CG94 B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments. J. ACM, 39:1-54, 1992. B. Cherkassky and A. Goldberg. On implementing push-relabel method for the maximum flow problem. Technical Report 94-1523, Department of Computer Science, Stanford University, 1994. CGJ96 E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In D. Hochbaum, editor, Approximation algorithms. PWS Publishing, 1996. CGL85 B. Chazelle, L. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76-90, 1985. CGPS76 H. L. Crane Jr., N. F. Gibbs, W. G. Poole Jr., and P. K. Stockmeyer. Matrix bandwidth and profile reduction. ACM Trans. Math. Softw., 2(4):375-377, December 1976. CGR93 B. Cherkassky, A. Goldberg, and T. Radzik. Shortest paths algorithms: theory and experimental evaluation. Technical Report 93-1480, Department of Computer Science, Stanford University, 1993. Cha71 file:///E|/BOOK/BOOK5/NODE232.HTM (9 of 50) [19/1/2003 1:28:01]

References J. M. Chambers. Partial sorting. Commun. ACM, 14(5):357-358, May 1971. Cha91 B. Chazelle. Triangulating a simple polygon in linear time. Discrete and Computational Geometry, 6:485-524, 1991. Che80 T-Y. Cheung. A program for the multifacility location problem with rectilinear distance by the minimum-cut approach. ACM Trans. Math. Softw., 6(3):430-431, September 1980. Chr76 N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh PA, 1976. CHT90 J. Cai, X. Han, and R. Tarjan. New solutions to four planar graph problems. Technical report, New York University, 1990. Chv83 V. Chvatal. Linear Programming. Freeman, San Francisco, 1983. CK70 CK75 CK80 CK94 Cla92 CLR90 D. Chand and S. Kapur. An algorithm for convex polytopes. J. ACM, 17:78-86, 1970. N. Christofides and S. Korman. A computational survey of methods for the set covering problem. Management Science, 21:591-599, 1975. W. Cheney and D. Kincaid. Numerical Mathematics and Computing. Brooks/Cole, Monterey CA, 1980. A. Chetverin and F. Kramer. Oligonucleotide arrays: New concepts and possibilities. Bio/Technology, 12:1093-1099, 1994. K. L. Clarkson. Safe and effective determinant evaluation. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pages 387-395, Pittsburgh, PA, 1992. file:///E|/BOOK/BOOK5/NODE232.HTM (10 of 50) [19/1/2003 1:28:01]

References<br />

J. M. Chambers. Partial sorting. Commun. ACM, 14(5):357-358, May 1971.<br />

Cha91<br />

B. Chazelle. Triangulating a simple polygon in linear time. Discrete and Computational Geometry,<br />

6:485-524, 1991.<br />

Che80<br />

T-Y. Cheung. A program for the multifacility location problem with rectilinear distance by the<br />

minimum-cut approach. ACM Trans. Math. Softw., 6(3):430-431, September 1980.<br />

Chr76<br />

N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem.<br />

Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University,<br />

Pittsburgh PA, 1976.<br />

CHT90<br />

J. Cai, X. Han, and R. Tarjan. New solutions to four planar graph problems. Technical report, New<br />

York University, 1990.<br />

Chv83<br />

V. Chvatal. Linear Programming. Freeman, San Francisco, 1983.<br />

CK70<br />

CK75<br />

CK80<br />

CK94<br />

Cla92<br />

CLR90<br />

D. Chand and S. Kapur. An algorithm for convex polytopes. J. ACM, 17:78-86, 1970.<br />

N. Christofides and S. Korman. A computational survey of methods for the set covering problem.<br />

Management Science, 21:591-599, 1975.<br />

W. Cheney and D. Kincaid. Numerical Mathematics and Computing. Brooks/Cole, Monterey CA,<br />

1980.<br />

A. Chetverin and F. Kramer. Oligonucleotide arrays: New concepts and possibilities.<br />

Bio/Technology, 12:1093-1099, 1994.<br />

K. L. Clarkson. Safe and effective determinant evaluation. In Proc. 31st IEEE Symposium on<br />

Foundations of Computer Science, pages 387-395, Pittsburgh, PA, 1992.<br />

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

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!