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.

• The submodular knapsack polytope (Q1040079) (← links)
• Robust placement of sensors in dynamic water distribution systems (Q1040992) (← links)
• A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
• A tree search algorithm for the multi-commodity location problem (Q1058962) (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
• Unimodular functions (Q1079493) (← links)
• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
• Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
• Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
• Submodularity and the traveling salesman problem (Q1124707) (← links)
• Structure preserving reductions among convex optimization problems (Q1143173) (← links)
• A cost operator approach to multistage location-allocation (Q1148206) (← links)
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale (Q1278239) (← links)
• Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
• Fixed points approach to clustering (Q1314827) (← links)
• On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
• A fast algorithm for finding matching responses in a survey data table (Q1377486) (← links)
• Clustering on trees (Q1392041) (← links)
• Locating service facilities whose reliability is distance dependent. (Q1422360) (← links)
• A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658) (← links)
• Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• Submodular learning and covering with response-dependent costs (Q1663646) (← links)
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
• FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
• On general threshold and general cascade models of social influence (Q1698071) (← links)
• Efficient influence maximization under TSCM: a suitable diffusion model in online social networks (Q1701602) (← links)
• Rough set methods in feature selection via submodular function (Q1701849) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• Recommending links through influence maximization (Q1731508) (← links)
• Multi-attribute proportional representation (Q1731837) (← links)
• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
• Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
• An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
• Multi-level facility location problems (Q1754251) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
• Implicit enumeration strategies for the hypervolume subset selection problem (Q1782182) (← links)
• Optimization of stochastic virus detection in contact networks (Q1785322) (← links)
• General asymptotic and submodular results for the Median problem with unreliable facilities (Q1785421) (← links)
• Risk averse submodular utility maximization (Q1785423) (← links)
• Assortment optimization over time (Q1785447) (← links)
• A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← links)
• Robust monotone submodular function maximization (Q1801019) (← links)