Pages that link to "Item:Q3167647"

The following pages link to Towards Minimizing k-Submodular Functions (Q3167647):

Displaying 24 items.

• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
• L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• A compact representation for modular semilattices and its applications (Q2006979) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Information coverage maximization for multiple products in social networks (Q2182654) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465) (← links)
• On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
• On $k$-Submodular Relaxation (Q2820856) (← links)
• On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
• A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
• (Q5090503) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
• Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
• \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)