Pages that link to "Item:Q5171231"
From MaRDI portal
The following pages link to Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions (Q5171231):
Displaying 4 items.
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
