摘要
Inthisnote,theauthorprovesthattheinverseproblemofsubmodularfunctionondigraphswithl∞objectivefunctioncanbesolvedbystronglypolynomialalgorithm.Theresultshowsthatmostinversenetworkoptimizationproblemswithl∞objectivefunctioncanbesolvedinthepolynomialtime.
出版日期
1998年03月13日(中国期刊网平台首次上网日期,不代表论文的发表时间)