Geometric Algorithms and Combinatorial Optimization

About Geometric Algorithms and Combinatorial Optimization

0. Mathematical Preliminaries.- 0.1 Linear Algebra and Linear Programming.- Basic Notation.- Hulls, Independence, Dimension.- Eigenvalues, Positive Definite Matrices.- Vector Norms, Balls.- Matrix Norms.- Some Inequalities.- Polyhedra, Inequality Systems.- Linear (Diophantine) Equations and Inequalities.- Linear Programming and Duality.- 0.2 Graph Theory.- Graphs.- Digraphs.- Walks, Paths, Circuits, Trees.- 1. Complexity, Oracles, and Numerical Computation.- 1.1 Complexity Theory: P and NP.- Problems.- Algorithms and Turing Machines.- Encoding.- Time and Space Complexity.- Decision Problems: The Classes P and NP.- 1.2 Oracles.- The Running Time of Oracle Algorithms.- Transformation and Reduction.- NP-Completeness and Related Notion.- 1.3 Approximation and Computation of Numbers.- Encoding Length of Numbers.- Polynomial and Strongly Polynomial Computations.- Polynomial Time Approximation…

How CheapestTextbooks.com compares prices

When you open this page we ask eCampus, Knetbooks, BiggerBooks and VitalSource for their current prices on ISBN 9783642782411 and sort every offer by its total with shipping. Rental rows show the term (semester, quarter or short term) and that term goes with you to the store's cart, and eBook rows link straight to the 180-day or no-expiry option you picked. Prices are rechecked at least every 30 minutes, so confirm the total at checkout.

Browse all textbook subjects