简介:Inthisnote,theauthorprovesthattheinverseproblemofsubmodularfunctionondigraphswithl∞objectivefunctioncanbesolvedbystronglypolynomialalgorithm.Theresultshowsthatmostinversenetworkoptimizationproblemswithl∞objectivefunctioncanbesolvedinthepolynomialtime.
NOTE ON INVERSE PROBLEM WITH l∞ OBJECTIVE FUNCTION