Pages that link to "Item:Q1906848"

The following pages link to Minimizing submodular functions over families of sets (Q1906848):

Displaying 18 items.

• Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
• Ideal clutters (Q697573) (← links)
• Edge-connectivity augmentation of graphs over symmetric parity families (Q998390) (← links)
• Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
• Minimizing symmetric submodular functions (Q1290631) (← links)
• Submodular function minimization with submodular set covering constraints and precedence constraints (Q1644928) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• Reachability in arborescence packings (Q2166224) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Co-density and fractional edge cover packing (Q2175043) (← links)
• Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• Densities, Matchings, and Fractional Edge-Colorings (Q4620419) (← links)
• (Q5009516) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
• A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)