£ 2.82 shipping within U.S.A.
Destination, rates & speedsSeller: HPB-Red, Dallas, TX, U.S.A.
paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_424883088
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020317949
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783662585665
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783662585665
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783662585665_new
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. Seller Inventory # 26375862243
Quantity: 4 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout,it contains complete but concise proofs, and also provides numerousexercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ )-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. 720 pp. Englisch. Seller Inventory # 9783662585665
Quantity: 2 available
Seller: Russell Books, Victoria, BC, Canada
Paperback. Condition: New. Special order direct from the distributor Softcover reprint of the original 6th ed. 2018. Seller Inventory # ING9783662585665
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand. Seller Inventory # 370183228
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND. Seller Inventory # 18375862249
Quantity: 4 available