Approximation Algorithms for Traveling Salesman Problems

About The Book

This is the first book on approximation algorithms for the Traveling Salesman Problem a central topic in discrete mathematics theoretical computer science and combinatorial optimization. It presents the state of the art comprehensively as well as advances it making it an excellent resource for teaching self-study and further research.
Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
downArrow

Details


LOOKING TO PLACE A BULK ORDER?CLICK HERE