Note on inverse problem with l_∞ objective function

摘要

In this note, the author proves that he inverse problem of submodular function on digraphs with l_∞objective function can be solved by strongly polynomial algorithm. The result shows that most inverse network optimization problems with l_∞objective function can be solved in the polynomial time.