LEADER 03727nam  22007212  450 
001 9910457956503321
005 20151005020624.0
010   $a1-107-14888-X
010   $a1-280-45797-X
010   $a9786610457977
010   $a0-511-18604-5
010   $a0-511-18521-9
010   $a0-511-18790-4
010   $a0-511-31388-8
010   $a0-511-61667-8
010   $a0-511-18697-5
035   $a(CKB)1000000000353168
035   $a(EBL)256703
035   $a(OCoLC)171138586
035   $a(SSID)ssj0000163458
035   $a(PQKBManifestationID)11163312
035   $a(PQKBTitleCode)TC0000163458
035   $a(PQKBWorkID)10116690
035   $a(PQKB)11073863
035   $a(UkCbUP)CR9780511616679
035   $a(OCoLC)560090892
035   $a(MiAaPQ)EBC256703
035   $a(Au-PeEL)EBL256703
035   $a(CaPaEBR)ebr10124735
035   $a(CaONFJC)MIL45797
035   $a(OCoLC)69870235
035   $a(EXLCZ)991000000000353168
100   $a20090915d2004||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGlobal methods for combinatorial isoperimetric problems /$fL.H. Harper$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2004.
215   $a1 online resource (xiv, 232 pages) $cdigital, PDF file(s)
225 1 $aCambridge studies in advanced mathematics ;$v90
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a0-521-18383-9 
311   $a0-521-83268-3 
320   $aIncludes bibliographical references and index.
327   $a1. 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 -- App. The classical isoperimetric problem.
330   $aCertain 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.
410  0$aCambridge studies in advanced mathematics ;$v90.
606   $aCombinatorial optimization
606   $aCalculus of variations
606   $aMorphisms (Mathematics)
615  0$aCombinatorial optimization.
615  0$aCalculus of variations.
615  0$aMorphisms (Mathematics)
676   $a519.6/4
700   $aHarper$b Lawrence H$g(Lawrence Hueston),$f1938-$053982
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910457956503321
996   $aGlobal methods for combinatorial isoperimetric problems$9668393
997   $aUNINA