Finding the largest suborder of fixed width
暂无分享,去创建一个
Finding the largest suborder of fixed width in a partially ordered set is an interesting combinatorial problem with applications in combinatorial optimization and scheduling. We present a polynomial time solution for this problem by transforming it into a minimum cost network flow problem in an appropriate auxiliary network.