The Weighted Sperner's Set Problem
作者： X. Berenguer , J. Diaz
DOI: 10.1007/BFB0022500
关键词: Special ordered set 、 Discrete mathematics 、 Mathematics 、 Set packing 、 Index set 、 Combinatorics 、 Infinite set 、 Antichain 、 Set function 、 Maximal independent set 、 Solution set
摘要: A polynomial time bounded algorithm is presented for solving the Weighted Sperner's Set Problem, that is, problem of computing an independent maximal weight on a weighted partially ordered set.
springer.com
sci-hub.se 参考文章(2)
Eugene L. Lawler, Combinatorial optimization : networks and matroids Dover Publications. ,(1976)
Martin Charles Golumbic, Algorithmic graph theory and perfect graphs ,(1980)