Discrete Geometry and Optimization
Károly Bezdek
Reading Time
at 250 WPM5h 36m
The average reader, reading at a speed of 250 WPM, would take 5h 36m to read Discrete Geometry and Optimization.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
12
days at 30 min/day
336
total minutes
Discrete Geometry and Optimization
by Károly Bezdek, Antoine Deza, Yinyu Ye
Published
2013
Publisher
Springer London, Limited
Pages
336
ISBN-13
9783319002002
Description
Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.
Handbook of discrete and computational geometry
Discrete geometry
Geometric Aspects of Functional Analysis
Research Problems in Discrete Geometry
Elementary Differential Geometry
Forbidden Configurations in Discrete Geometry
Frequently Asked Questions
How many pages are in Discrete Geometry and Optimization?
This edition of Discrete Geometry and Optimization has approximately 336 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 Discrete Geometry and Optimization?
For most readers, Discrete Geometry and Optimization typically takes between 7h 0m and 4h 40m to complete. This is based on the book's length of approximately 84,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 5h 36m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 12 days • Estimated word count: 84,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 Discrete Geometry and Optimization?
The estimated word count for Discrete Geometry and Optimization is approximately 84,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 Discrete Geometry and Optimization?
Discrete Geometry and Optimization was written by Károly Bezdek, Antoine Deza, Yinyu Ye.
When was Discrete Geometry and Optimization published?
The publication date for this specific edition is 2013. The original work may have been published on a different date.