Global Methods for Combinatorial Isoperimetric Problems
Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on g...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | E-Book Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
09.02.2004
|
| Ausgabe: | 1 |
| Schriftenreihe: | Cambridge Studies in Advanced Mathematics |
| Schlagworte: | |
| ISBN: | 0521183839, 9780521832687, 9780521183833, 0521832683 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure. This book is based on Professor Harper's many years' experience in teaching this subject 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. |
|---|---|
| Bibliographie: | Includes bibliographical references (p. 223-227) and index Available also in a print ed. Mode of access: Internet via World Wide Web. Title from title screen. |
| ISBN: | 0521183839 9780521832687 9780521183833 0521832683 |
| DOI: | 10.1017/CBO9780511616679 |