@article{840048,
      recid = {840048},
      author = {Lau, Lap Chi. and Ravi, R. and Singh, Mohit.},
      title = {Iterative methods in combinatorial optimization  [electronic resource] /},
      publisher = {Cambridge University Press,},
      address = {Cambridge ;},
      pages = {xi, 242 p. :},
      year = {2011},
      abstract = {"With the advent of approximation algorithms for NP-hard  combinatorial optimization problems, several techniques  from exact optimization such as the primal-dual method have  proven their staying power and versatility. This book  describes a simple and powerful method that is iterative in  essence, and similarly useful in a variety of settings for  exact and approximate optimization. The authors highlight  the commonality and uses of this method to prove a variety  of classical polyhedral results on matchings, trees,  matroids, and flows. The presentation style is elementary  enough to be accessible to anyone with exposure to basic  linear algebra and graph theory, making the book suitable  for introductory courses in combinatorial optimization at  the upper undergraduate and beginning graduate levels.  Discussions of advanced applications illustrate their  potential for future application in research in  approximation algorithms"--},
      url = {http://library.usi.edu/record/840048},
}