scientific article

DOI10.4230/LIPICS.STACS.2012.42zbMath1245.68253arXiv1108.4983MaRDI QIDQ2904748

Justin Ward

Publication date: 23 August 2012

Full work available at URL: https://arxiv.org/abs/1108.4983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local searchapproximation algorithmssubmodular maximization\(k\)-set packing\(k\)-exchange systems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (9)

The Power of Subsampling in Submodular Maximization ⋮ Submodular Maximization Through the Lens of Linear Programming ⋮ Unnamed Item ⋮ The multi-budget maximum weighted coverage problem ⋮ Practical budgeted submodular maximization ⋮ On the intersection of independence systems ⋮ Generalized budgeted submodular set function maximization ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint

This page was built for publication: