Skip to main content
Computer Science

Return to Answer

Add a proper reference, as the link was broken.
Source Link
D.W. ♦
D.W. ♦
  • 165.6k
  • 21
  • 230
  • 490

You can compute the maximum weight of an antichain, or more generally the maximum weight of a union of $k$ antichains, by reducing to the maximum flow problem. See for example a technical report by Congthe following technical report by Cong:

Computing Maximum Weighted K-Families and K-Cofamilies in Partially Ordered Sets. J. Cong. UCLA CS Dept Technical Report CSD-930014, May 1993.

You can compute the maximum weight of an antichain, or more generally the maximum weight of a union of $k$ antichains, by reducing to the maximum flow problem. See for example a technical report by Cong.

You can compute the maximum weight of an antichain, or more generally the maximum weight of a union of $k$ antichains, by reducing to the maximum flow problem. See for example the following technical report by Cong:

Computing Maximum Weighted K-Families and K-Cofamilies in Partially Ordered Sets. J. Cong. UCLA CS Dept Technical Report CSD-930014, May 1993.

Source Link
Yuval Filmus
Yuval Filmus
  • 279.1k
  • 27
  • 316
  • 512

You can compute the maximum weight of an antichain, or more generally the maximum weight of a union of $k$ antichains, by reducing to the maximum flow problem. See for example a technical report by Cong.