Pages that link to "Item:Q5171231"

The following pages link to Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions (Q5171231):

Displaying 16 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)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
• New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
• The multi-budget maximum weighted coverage problem (Q2692723) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• (Q5009516) (← links)
• (Q5197582) (← links)