Show simple item record

dc.contributor.authorLiu, L. C.zh_CN
dc.contributor.authorZhang, J. Z.zh_CN
dc.contributor.author刘龙城zh_CN
dc.date.accessioned2013-12-12T02:49:20Z
dc.date.available2013-12-12T02:49:20Z
dc.date.issued2006zh_CN
dc.identifier.citationJournal of Combinatorial Optimization,12(4):394-407zh_CN
dc.identifier.issn1382-6905zh_CN
dc.identifier.otherISI:000241166500007zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/70640
dc.description.abstractIn this paper, we consider inverse maximum flow problem under the weighted Hamming distance. Four models are studied: the problem under sum-type weighted Hamming distance; the problem under bottleneck-type weighted Hamming distance and two mixed types of problems. We present their respective combinatorial algorithms that all run in strongly polynomial times.zh_CN
dc.language.isoen_USzh_CN
dc.subjectmaximum flowzh_CN
dc.subjectinverse problemszh_CN
dc.subjectHamming distancezh_CN
dc.subjectstrongly polynomial algorithmszh_CN
dc.titleInverse maximum flow problems under the weighted Hamming distancezh_CN
dc.typeArticlezh_CN


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record