Geometric Algorithms and Combinatorial Optimization
Martin Grötschel
Reading Time
at 250 WPM6h 20m
The average reader, reading at a speed of 250 WPM, would take 6h 20m to read Geometric Algorithms and Combinatorial Optimization.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
13
days at 30 min/day
380
total minutes
Geometric Algorithms and Combinatorial Optimization
by Martin Grötschel, Unknown Author, Alexander Schrijver
Published
1993
Publisher
Island Press
Pages
380
ISBN-13
9783642782411
Description
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This 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. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1
Subjects
Geometry of numbers
An introduction to the geometry of numbers
Development of the Minkowski geometry of numbers
Geometry of Numbers
The geometry of numbers
Geometry of numbers
Frequently Asked Questions
How many pages are in Geometric Algorithms and Combinatorial Optimization?
This edition of Geometric Algorithms and Combinatorial Optimization has approximately 380 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Geometric Algorithms and Combinatorial Optimization?
For most readers, Geometric Algorithms and Combinatorial Optimization typically takes between 7h 55m and 5h 17m to complete. This is based on the book's length of approximately 95,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 6h 20m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 13 days • Estimated word count: 95,000 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Geometric Algorithms and Combinatorial Optimization?
The estimated word count for Geometric Algorithms and Combinatorial Optimization is approximately 95,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Geometric Algorithms and Combinatorial Optimization?
Geometric Algorithms and Combinatorial Optimization was written by Martin Grötschel, Unknown Author, Alexander Schrijver.
When was Geometric Algorithms and Combinatorial Optimization published?
The publication date for this specific edition is 1993. The original work may have been published on a different date.