Author: Dieter Jungnickel
Publisher: Springer
Keywords: algorithms, mathematics, computation, graphs, networks
Number of Pages: 650
Published: 2007-11-16
List price: $109.00
ISBN-10: 3540727795
ISBN-13: 9783540727798

From reviews of the previous editions “.... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the boo

Author: Jan Modersitzki
Publisher: Society for Industrial and Applied Mathematics
Keywords: algorithms, fundamentals, registration, image, fair, flexible
Number of Pages: 211
Published: 2009-10-19
List price: $69.00
ISBN-10: 089871690X
ISBN-13: 9780898716900

Whenever images taken at different times, from different viewpoints, and/or by different sensors need to be compared, merged, or integrated, image registration is required. Registration, also known as alignment, fusion, or warping, is the process of transforming data into a common reference frame. This book provides an overview of state-of-the-art registration techniques from theory to practice, plus numerous exercises designed to enhance readers understanding of the principles and mechanisms of the described techniques. It also provides, via a supplementary Web page, free access to FAIR.m

Author: Robert Sedgewick
Publisher: Addison-Wesley Professional
Keywords: algorithms, graph, part
Number of Pages: 528
Published: 2002-01-06
List price: $54.99
ISBN-10: 0201361183
ISBN-13: 9780201361186

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick’s classic series on algorithms, this is the field’s definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book’s value to developers, student

Author: Robert Sedgewick
Publisher: Addison-Wesley Professional
Keywords: algorithms, graph, part
Number of Pages: 512
Published: 2001-08-26
List price: $54.99
ISBN-10: 0201316633
ISBN-13: 9780201316636

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is th

Author: Per Christian Hansen
Publisher: SIAM-Society for Industrial and Applied Mathematics
Keywords: algorithms, fundamentals, insight, problems, inverse, discrete
Number of Pages: 225
Published: 2010-02-24
List price: $65.00
ISBN-10: 0898716969
ISBN-13: 9780898716962

Inverse problems arise when we reconstruct a sharper image from a blurred one or reconstruct the underground mass density from measurements of the gravity above the ground. When we solve an inverse problem, we compute the source that gives rise to some observed data using a mathematical model for the relation between the source and the data. This book gives an introduction to the practical treatment of inverse problems by means of numerical methods, with a focus on basic mathematical and computational aspects. To solve inverse problems, we demonstrate that insight about them goes hand in ha

Authors:Bernhard Korte, Jens Vyge,
Publisher: Springer
Keywords: algorithms, combinatorics, theory, optimization, combinatorial
Number of Pages: 627
Published: 2007-11-29
List price: $79.95
ISBN-10: 3540718435
ISBN-13: 9783540718437

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is a

Authors:Bernhard Korte, Jens Vygen,
Publisher: Springer
Keywords: algorithms, combinatorics, theory, optimization, combinatorial
Number of Pages: 597
Published: 2005-10-06
List price: $74.95
ISBN-10: 3540256849
ISBN-13: 9783540256847

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as