The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Moret and Shapiro's Algorithms P to NP Moret and Shapiro's Algorithms P to NP This algorithms text distinguishes itself by including Pascal implementations of many algorithms, with careful experimental comparisons of different algorithms for such problems as sorting and minimum spanning tree, and heuristics for the traveling salesman problem. It provides a useful model for how to properly do empirical algorithm analysis. The programs themselves are probably best used as models. Interesting implementations include the eight-queens problem, fundamental graph and geometric algorithms. The programs in the book have been made available by anonymous ftp from cs.unm.edu in directory /pub/moret_shapiro. ● Link to Moret's Home Page - files under publications ● Download Files (local site) Problem Links ● Sorting (7) ● Minimum Spanning Tree (5) ● Connected Components (4) ● Edge and Vertex Connectivity (4) ● Discrete Fourier Transform (4) ● Robust Geometric Primitives (4) ● Graph Data Structures (4) ● Matching (4) ● Network Flow (4) ● Set Data Structures (4) ● Convex Hull (3) ● Intersection Detection (3) ● Nearest Neighbor Search (3) ● Point Location (3) ● Priority Queues (3) ● Searching (3) ● Topological Sorting (3) file:///E|/WEBSITE/IMPLEMEN/MORET/IMPLEMEN.HTM (1 of 2) [19/1/2003 1:37:38]
Moret and Shapiro's Algorithms P to NP About the Book Send us Mail Go to Main Page This page last modified on Feb 23, 1996. file:///E|/WEBSITE/IMPLEMEN/MORET/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:37:38]
- Page 1223 and 1224: 1.3.9 Job Scheduling ● Feedback E
- Page 1225 and 1226: 1.4.2 Topological Sorting Related P
- Page 1227 and 1228: 1.4.8 Edge and Vertex Connectivity
- Page 1229 and 1230: 1.4.10 Drawing Graphs Nicely ● Pl
- Page 1231 and 1232: 1.4.11 Drawing Trees ● Planarity
- Page 1233 and 1234: 1.4.12 Planarity Detection and Embe
- Page 1235 and 1236: 1.5.2 Independent Set ● Vertex Co
- Page 1237 and 1238: 1.5.3 Vertex Cover ● Independent
- Page 1239 and 1240: 1.5.4 Traveling Salesman Problem
- Page 1241 and 1242: 1.5.6 Graph Partition ● Network F
- Page 1243 and 1244: 1.5.7 Vertex Coloring Related Probl
- Page 1245 and 1246: 1.5.11 Feedback Edge/Vertex Set Go
- Page 1247 and 1248: 1.6.1 Robust Geometric Primitives G
- Page 1249 and 1250: 1.6.6 Range Search ● Kd-Trees ●
- Page 1251 and 1252: 1.6.8 Intersection Detection ● Ro
- Page 1253 and 1254: 1.6.16 Minkowski Sum Go to the corr
- Page 1255 and 1256: 1.7.1 Set Cover ● Set Packing ●
- Page 1257 and 1258: 1.7.2 Set Packing Go to the corresp
- Page 1259 and 1260: 1.7.3 String Matching ● Approxima
- Page 1261 and 1262: 1.7.4 Approximate String Matching
- Page 1263 and 1264: 1.7.5 Text Compression Go to the co
- Page 1265 and 1266: 1.7.6 Cryptography ● Text Compres
- Page 1267 and 1268: 1.7.7 Finite State Machine Minimiza
- Page 1269 and 1270: 1.7.8 Longest Common Substring ●
- Page 1271 and 1272: 1.7.9 Shortest Common Superstring G
- Page 1273: Handbook of Algorithms and Data Str
- Page 1277 and 1278: Index B Up: Index - All Index: B ba
- Page 1279 and 1280: Index C Up: Index - All Index: C ch
- Page 1281 and 1282: Index E Up: Index - All Index: E ed
- Page 1283 and 1284: Index G Up: Index - All Index: G ga
- Page 1285 and 1286: Index I Up: Index - All Index: I in
- Page 1287 and 1288: Index L Up: Index - All Index: L li
- Page 1289 and 1290: Index N Up: Index - All Index: N ne
- Page 1291 and 1292: Index P Up: Index - All Index: P pa
- Page 1293 and 1294: Index R Up: Index - All Index: R RA
- Page 1295 and 1296: Index S successor supercomputer , s
- Page 1297 and 1298: Index U Up: Index - All Index: U un
- Page 1299 and 1300: Index W Up: Index - All Index: W wo
- Page 1301 and 1302: Index (complete) bin packing bipart
- Page 1303 and 1304: Index (complete) Fourier transform
- Page 1305 and 1306: Index (complete) parenthesization p
- Page 1307 and 1308: Index (complete) symmetry, exploiti
- Page 1309 and 1310: Ranger - Nearest Neighbor Search in
- Page 1311 and 1312: DIMACS Implementation Challenges Pe
- Page 1313 and 1314: Stony Brook Project Implementations
- Page 1315 and 1316: Clarkson's higher dimensional conve
- Page 1317 and 1318: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1319 and 1320: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1321 and 1322: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1323 and 1324: file:///E|/WEBSITE/BIBLIO/TESTDATA/
Moret and Shapiro's <strong>Algorithm</strong>s P to NP<br />
Moret and Shapiro's <strong>Algorithm</strong>s P to NP<br />
This algorithms text distinguishes itself by including Pascal implementations of many algorithms, with<br />
careful experimental comparisons of different algorithms for such problems as sorting and minimum<br />
spanning tree, and heuristics for the traveling salesman problem. It provides a useful model for how to<br />
properly do empirical algorithm analysis.<br />
<strong>The</strong> programs themselves are probably best used as models. Interesting implementations include the<br />
eight-queens problem, fundamental graph and geometric algorithms.<br />
<strong>The</strong> programs in the book have been made available by anonymous ftp from cs.unm.edu in directory<br />
/pub/moret_shapiro.<br />
● Link to Moret's Home Page - files under publications<br />
● Download Files (local site)<br />
Problem Links<br />
● Sorting (7)<br />
● Minimum Spanning Tree (5)<br />
● Connected Components (4)<br />
● Edge and Vertex Connectivity (4)<br />
● Discrete Fourier Transform (4)<br />
● Robust Geometric Primitives (4)<br />
● Graph Data Structures (4)<br />
● Matching (4)<br />
● Network Flow (4)<br />
● Set Data Structures (4)<br />
● Convex Hull (3)<br />
● Intersection Detection (3)<br />
● Nearest Neighbor Search (3)<br />
● Point Location (3)<br />
● Priority Queues (3)<br />
● Searching (3)<br />
● Topological Sorting (3)<br />
file:///E|/WEBSITE/IMPLEMEN/MORET/IMPLEMEN.HTM (1 of 2) [19/1/2003 1:37:38]