Pages that link to "Item:Q1290631"

The following pages link to Minimizing symmetric submodular functions (Q1290631):

Displaying 35 items.

• Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
• Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• Minimizing a sum of submodular functions (Q713320) (← links)
• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• Minimum degree orderings (Q848936) (← links)
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Source location in undirected and directed hypergraphs (Q943798) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
• Submodular function minimization (Q995782) (← links)
• A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
• Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
• Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
• Efficient search for informational cores in complex systems: application to brain networks (Q2057764) (← links)
• Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
• A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
• Cuts in undirected graphs. II (Q2215853) (← links)
• Exploiting structure of chance constrained programs via submodularity (Q2280674) (← links)
• Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
• Unifying the representation of symmetric crossing families and weakly partitive families (Q2851484) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
• Maximizing Symmetric Submodular Functions (Q3452815) (← links)
• The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
• Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• (Q5111689) (← links)
• Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
• Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
• A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)