Synopses & Reviews
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.
"It is a very nice and useful book, written by a real expert in the field. I believe that both specialists in the area and mathematicians with other backgrounds will find lots of new interesting material in this book." Igor Shparlinski, Mathematics of Computation
Based on Professor Harper's substantial experience in teaching global methods in combinatorial optimisation and is ideal for graduate students entering the field as well as experienced researchers. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science.
This book is based on Professor Harper's many years experience in teaching global methods in combinatorial optimisation and is ideal for graduate students entering the field. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science. Applied systematically, the global point of view can lead to surprising insights and results and established researchers will find this to be a valuable reference work on an innovative method for problem solving.
Global methods in combinatorial optimisation for graduate students and researchers. Exercises and applications to computer science.
This 2004 text explores global methods in combinatorial optimization and is suitable for graduate students and researchers.
Table of Contents
1. The edge-isoperimetric problem; 2. The minimum path problem; 3. Stabilization and compression; 4. The vertex-isoperimetric problem; 5. Stronger stabilization; 6. Higher compression; 7. Isoperimetric problems on infinite graphs; 8. Isoperimetric problems on complexes; 9. Morphisms for MWI problems; 10. Passage to the limit; 11. Afterword; 12. The classical isoperimetric problem.