Pages that link to "Item:Q1290631"
From MaRDI portal
The following pages link to Minimizing symmetric submodular functions (Q1290631):
Displaying 13 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)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
