scientific article; zbMATH DE number 6850334
From MaRDI portal
Publication:4607903
zbMath1403.68332MaRDI QIDQ4607903
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175292
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Linear programming (90C05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (5)
Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice ⋮ Partial Resampling to Approximate Covering Integer Programs ⋮ Multiplicative auction algorithm for approximate maximum weight bipartite matching ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
This page was built for publication:
