%0 Book %1 Papadimitriou1998Combinatorial %A Papadimitriou, Christos H. %A Steiglitz, Kenneth %D 1998 %I Dover Publications %K iitm library %T Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) %U http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0486402584 %X <div>This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."&\#8212;<i>American Mathematical Monthly.</i> 1982 edition.<br></div> %7 Unabridged %@ 0486402584

@book{Papadimitriou1998Combinatorial, abstract = {{<div>This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."\&\#8212;<i>American Mathematical Monthly.</i> 1982 edition.<br></div>}}, added-at = {2018-12-02T16:09:07.000+0100}, author = {Papadimitriou, Christos H. and Steiglitz, Kenneth}, biburl = {https://www.bibsonomy.org/bibtex/23726beaa584605dacba6bd3c23aa3a2c/karthikraman}, citeulike-article-id = {472316}, citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0486402584}, citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0486402584}, citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0486402584}, citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0486402584}, citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0486402584/citeulike00-21}, citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0486402584}, citeulike-linkout-6 = {http://www.worldcat.org/isbn/0486402584}, citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0486402584}, citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0486402584\&index=books\&linkCode=qs}, citeulike-linkout-9 = {http://www.librarything.com/isbn/0486402584}, day = 29, edition = {Unabridged}, howpublished = {Paperback}, interhash = {86c4b05ac827876c50587b5cb33fc1c0}, intrahash = {3726beaa584605dacba6bd3c23aa3a2c}, isbn = {0486402584}, keywords = {iitm library}, month = jan, posted-at = {2013-11-13 08:17:49}, priority = {2}, publisher = {Dover Publications}, timestamp = {2018-12-02T16:09:07.000+0100}, title = {Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)}, url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0486402584}, year = 1998 }