The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Interesting Data Files Interesting Data Files Below we point to several interesting data files. These files can be used as test data for several of the Implementation Challenges given in The Algorithm Design Manual , but are also likely to be of independent interest. ● Airplane routes and schedules (from Roberto Tamassia -- local copy) ● Name-ethnicity data; over 3000 names from several nations (local copy) About the Book Send us Mail Go to Main Page file:///E|/WEBSITE/BIBLIO/TESTDATA/DATA.HTM [19/1/2003 1:36:29]
About the Ratings About the Ratings Our implementations are classified by the problems they solve. For each problem, we rate all the implementations according to usefulness on a 1 to 10 scale, with 10 meaning the most useful and 1 least useful. The usefulness of an implementation is supposed to reflect how likely it is that someone looking for code will be happy with what they find. Our ratings are completely subjective and reflect our judgement. Please feel free to send corrections and feedback based on your experiences. Please note that many of these implementations with low usefulness ratings were produced primarily for expository purposes, and can serve as excellent models to study or emulate if not as ready-to-run code. Go to Main Page file:///E|/WEBSITE/INFO/RATINGS.HTM [19/1/2003 1:36:29]
- Page 1031 and 1032: Lecture 22 - techniques for proving
- Page 1033 and 1034: Lecture 22 - techniques for proving
- Page 1035 and 1036: Lecture 23 - approximation algorith
- Page 1037 and 1038: Lecture 23 - approximation algorith
- Page 1039 and 1040: Lecture 23 - approximation algorith
- Page 1041 and 1042: Lecture 23 - approximation algorith
- Page 1043 and 1044: Lecture 23 - approximation algorith
- Page 1045 and 1046: About this document ... Up: No Titl
- Page 1047 and 1048: 1.1.6 Kd-Trees ● Point Location
- Page 1049 and 1050: 1.1.3 Suffix Trees and Arrays Send
- Page 1051 and 1052: 1.5.1 Clique ● Vertex Cover Go to
- Page 1053 and 1054: 1.6.2 Convex Hull Related Problems
- Page 1055 and 1056: Visual Links Index file:///E|/WEBSI
- Page 1057 and 1058: Visual Links Index file:///E|/WEBSI
- Page 1059 and 1060: Visual Links Index file:///E|/WEBSI
- Page 1061 and 1062: Visual Links Index file:///E|/WEBSI
- Page 1063 and 1064: Visual Links Index file:///E|/WEBSI
- Page 1065 and 1066: Visual Links Index file:///E|/WEBSI
- Page 1067 and 1068: Visual Links Index file:///E|/WEBSI
- Page 1069 and 1070: Visual Links Index file:///E|/WEBSI
- Page 1071 and 1072: Visual Links Index file:///E|/WEBSI
- Page 1073 and 1074: Visual Links Index file:///E|/WEBSI
- Page 1075 and 1076: Visual Links Index file:///E|/WEBSI
- Page 1077 and 1078: Visual Links Index file:///E|/WEBSI
- Page 1079 and 1080: Visual Links Index file:///E|/WEBSI
- Page 1081: Visual Links Index file:///E|/WEBSI
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087 and 1088: 1.4 Graph Problems -- polynomial-ti
- Page 1089 and 1090: 1.6 Computational Geometry 1.6 Comp
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113 and 1114: Combinatorica Combinatorica Combina
- Page 1115 and 1116: file:///E|/WEBSITE/IMPLEMEN/GRAPHBA
- Page 1117 and 1118: 1.4.1 Connected Components 1.4.1 Co
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
About the Ratings<br />
About the Ratings<br />
Our implementations are classified by the problems they solve. For each problem, we rate all the<br />
implementations according to usefulness on a 1 to 10 scale, with 10 meaning the most useful and 1 least<br />
useful. <strong>The</strong> usefulness of an implementation is supposed to reflect how likely it is that someone looking<br />
for code will be happy with what they find. Our ratings are completely subjective and reflect our<br />
judgement. Please feel free to send corrections and feedback based on your experiences. Please note that<br />
many of these implementations with low usefulness ratings were produced primarily for expository<br />
purposes, and can serve as excellent models to study or emulate if not as ready-to-run code.<br />
Go to Main Page<br />
file:///E|/WEBSITE/INFO/RATINGS.HTM [19/1/2003 1:36:29]
Change language