 |
 |
 |
 |
|
|
|
 |
 |
LIST PRICE $85.00 Save 68%
|
 |
 |
|
|
 |
Format: Hardcover ISBN-10: 0262032937 ISBN-13: 9780262032933 Sep 2001 Publisher: Mit Pr 1180 pages Edition: 2 Language: English |
 |
|
|
|
 |
 |
 |
In general items shipped via Media Mail should arrive in 2-9 days (excluding Alaska and Hawaii) from the time of shipping * ML=ships from multiple locations, AE/AP/AA=ships from U.S. Military location.
|
|
|
 |
 |
|
 |
 |
Details

| Size | | Length: | 1180 pages | | Height: | 9.0 in | | Width: | 8.3 in | | Thickness: | 2.2 in | | Weight: | 73.6 oz |
Industry Reviews Both rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms. Annotation copyright Book News, Inc. Portland, Or. Drury
|
|
|
|
Other Editions
|
|
|
Similar Items on eBay

|
|