Now showing items 1-1 of 1

    • Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters 

      Ferchiou, Zouhaier (University of Waterloo, 2021-01-29)
      Given a family of sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages