Inverse minimum cost flow problems under the weighted Hamming distance
Keywords: فاصله هام مینگ; Network flows; Inverse problem; Hamming distance; APX-hard; Strongly polynomial algorithm