MFMC

(redirected from Max-Flow Min-Cut)
AcronymDefinition
MFMCMilan Free Methodist Church (Milan, MI)
MFMCMy Future Is My Choice (Namibia)
MFMCMax-Flow Min-Cut
MFMCMid-Florida Mustang Club
MFMCMonkfish Monitoring Committee
MFMCMoore's Ford Memorial Committee
MFMCMinnesota Federation of Music Clubs
MFMCMain Family Medicine Center
MFMCMutual Fund Management Company
MFMCMean Field Monte Carlo (algorithm)
MFMCMaricopa Foundation for Medical Care (Arizona)
MFMCMaquis Forces Marine Corps (fictional, Star Trek)
MFMCMedium Fat Medium Carbohydrate
MFMCMulti-Frame Motion Compensation
MFMCMicroFilmMobileCinema
MFMCMaths from Many Cultures (McGraw Hill UK foundation)
MFMCMestrado em Filosofia Moderna e Contemporânea (Portugese)
MFMCMoving Forward with Monroe County (New York)
MFMCMotorcycle Family Motorcycle Club (Decatur, AL)
MFMCMidwest Financial Mortgage Company
MFMCManpower & Force Management Course (US Army)
MFMCMiedzynarodowy Festiwal Muzyki Cerkiewnej (Polish)
MFMCMeadowood Free Methodist Church (Indiana)
MFMCMoonah Family Medical Centre (Australia)
MFMCMercy Fund Management Corp
MFMCMississippi Foundation for Medical Care
MFMCMonsey Family Medical Center (New York)
MFMCMiedzynarodowego Festiwalu Hajnowskie Dni Muzyki Cerkiewnej (Polish)
MFMCMaximum Flow Minimum Cut
MFMCMapleview Free Methodist Church (Omaha, Nebraska)
MFMCModerate Fat Moderate Cholesterol
MFMCMunicipal Fire Management Committee (New Zealand)
MFMCMolodovian Federation of Mountaineering and Climbing
MFMCMaximal Field Moisture Capacity
References in periodicals archive ?
Additional applications of the max-flow min-cut results described in the paper have also been discovered.
For a survey of all the work on max-flow min-cut theorems and their applications to approximation algorithms, we refer the reader to the excellent article by Shmoys [1996].
The remainder of the paper is organized as follows: The max-flow min-cut results are described in Section 2.
In this section, we prove max-flow min-cut theorems for several classes of multicommodity flow problems.
The max-flow min-cut theorems proved in Section 2 can be applied to develop good approximation algorithms for a surprisingly wide variety of NP-hard problems.
(1) Is there a max-flow min-cut theorem similar to Theorem 2 for directed multicommodity flow problems with general demands?