Description: A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages. Not ex-library. Fast Shipping - Safe and Secure Cardboard Box or Bubble Mailer! Sales support our local public libraries.
Price: 18 USD
Location: Oakland, California
End Time: 2024-10-30T01:34:14.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Publisher: Prentice Hall PTR
Subject: Combinatorics
Publication Year: 1981
Number of Pages: 512 Pages
Language: English
Publication Name: Combinatorial Optimization : Algorithm and Complexity
Type: Textbook
Author: Kenneth Steiglitz, Christos H. Papadimitriou
Subject Area: Mathematics
Format: Hardcover
