14 Matching Annotations
  1. Apr 2023

    Tags

    Annotators

  2. Mar 2023
    1. We have seen earlier thatsome feasible circulation Xl in G(XO) satisfies the property that x = XO + Xl.

      Applying the flow decomposition theorem from before, we decompose any flows into a sum of cycles flow and paths flows.

    2. Property 3.6. A circulation x can be represented as cycle flow along at mostm directed cycles.

      Circulation property. Why is it not along a \(m\) many closed walks?

      This is only true from the view of the flow decomposition algorithm and not the LP.

  3. Feb 2023

    Tags

    Annotators

  4. Jan 2016