Pages that link to "Item:Q3225170"

The following pages link to Submodular Approximation: Sampling-based Algorithms and Lower Bounds (Q3225170):

Displaying 33 items.

• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← 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)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Optimizing network topology for average controllability (Q2059509) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
• Multi-attribute based influence maximization in social networks: algorithms and analysis (Q2140569) (← links)
• Influence maximization in the presence of vulnerable nodes: a ratio perspective (Q2220831) (← links)
• Set function optimization (Q2314057) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• Activity preserving graph simplification (Q2435687) (← links)
• A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• Exact Sublinear Binomial Sampling (Q2872089) (← links)
• Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture (Q2969615) (← links)
• Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
• Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
• The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
• Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• (Q5009516) (← links)
• Bottom-k and priority sampling, set similarity and subset sums with minimal independence (Q5495807) (← links)
• (Q5874477) (← links)
• Exact sublinear binomial sampling (Q5963375) (← links)
• Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
• Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs (Q6051991) (← links)
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
• Minimization problems with non-submodular cover constraint (Q6542984) (← links)