Geometric Algorithms and Combinatorial Optimization (1993. Softcover Reprint of the Original 2nd 1993)Paperback - 1993. Softcover Reprint of the Original 2nd 1993, 21 December 2011

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: "This book ... is doubtless one of the outstanding books in discrete mathematics at all." (Journal of Information Proceedings and Cybernetics).