Global Methods for Combinatorial Isoperimetric Problems
2004
First Published
250
Number of Pages
Part of Series
The study of combinatorial isoperimetric problems exploits similarities between discrete optimization problems and the classical continuous setting. Based on his many years of teaching experience, Larry Harper focuses on global methods of problem solving. His text will enable graduate students and researchers to quickly reach the most current state of research in this topic. Harper includes numerous worked examples, exercises and material about applications to computer science.
