Global Methods for Combinatorial Isoperimetric Problems

by

Write The First Customer Review
Show Synopsis

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 ...

Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

Customer Reviews

Write a Review


This item doesn't have extra editions

loading