Pages that link to "Item:Q4152030"

The following pages link to An analysis of approximations for maximizing submodular set functions—I (Q4152030):

Displaying 50 items.

• An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
• Sensor placement for fault location identification in water networks: a minimum test cover approach (Q311945) (← links)
• Micro- and macromodels of social networks. I: Theory fundamentals (Q315127) (← links)
• Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
• The component commonality problem in a real multidimensional space: an algorithmic approach (Q320883) (← links)
• Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
• Optimal interval scheduling with a resource constraint (Q337149) (← links)
• On covering location problems on networks with edge demand (Q342492) (← links)
• Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications (Q389651) (← links)
• On the approximability of the link building problem (Q391785) (← links)
• Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
• Discriminative models for multi-class object layout (Q409108) (← links)
• Fast approximate energy minimization with label costs (Q409135) (← links)
• Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
• Is submodularity testable? (Q472463) (← links)
• Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
• An individual-based model of information diffusion combining friends' influence (Q489688) (← links)
• Measuring the impact of MVC attack in large complex networks (Q506775) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Maximizing a submodular function with viability constraints (Q513299) (← links)
• New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
• Item bidding for combinatorial public projects (Q526903) (← links)
• Optimization with uniform size queries (Q527424) (← links)
• Hooked on IP (Q537605) (← links)
• Maximizing a class of submodular utility functions (Q543403) (← links)
• Video distribution under multiple constraints (Q551203) (← links)
• An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
• Budgeted nature reserve selection with diversity feature loss and arbitrary split systems (Q662604) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
• Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios (Q744224) (← links)
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
• Recent trends in combinatorial optimization (Q788638) (← links)
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
• A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
• Logical processing for integer programming (Q817209) (← links)
• Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
• Streaming algorithms for robust submodular maximization (Q827610) (← links)
• Influence maximization problem: properties and algorithms (Q830929) (← links)
• Inferring range of information diffusion based on historical frequent items (Q832642) (← links)
• An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
• Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems (Q900693) (← links)
• Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Algorithms for storage allocation based on client preferences (Q975763) (← links)
• Optimally learning social networks with activations and suppressions (Q982645) (← links)
• Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)