scientific article; zbMATH DE number 7051222
From MaRDI portal
Publication:4633864
zbMath1421.68224MaRDI QIDQ4633864
Satoru Iwata, Nicholas J. A. Harvey, Michel X. Goemans, Vahab S. Mirrokni
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496829
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
The Limitations of Optimization from Samples ⋮ The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ On additive approximate submodularity ⋮ Gross substitutability: an algorithmic survey ⋮ Tractability of explaining classifier decisions ⋮ Unnamed Item ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ Is submodularity testable? ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions ⋮ Approximate Modularity Revisited ⋮ Finding Submodularity Hidden in Symmetric Difference ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas ⋮ Unnamed Item ⋮ New approximations and hardness results for submodular partitioning problems
This page was built for publication:
