Maximizing a submodular function with viability constraints
From MaRDI portal
Publication:513299
DOI10.1007/s00453-015-0066-yzbMath1357.92061arXiv1611.05753OpenAlexW2173482757MaRDI QIDQ513299
David P. Williamson, Wolfgang Dvořák, Monika R. Henzinger
Publication date: 6 March 2017
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05753
Problems related to evolution (92D15) Approximation methods and heuristics in mathematical programming (90C59) Population dynamics (general) (92D25) Ecology (92D40) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Maximizing a submodular function with viability constraints
- Optimizing phylogenetic diversity with ecological constraints
- Budgeted nature reserve selection with diversity feature loss and arbitrary split systems
- The hardness of approximation: Gap location
- The budgeted maximum coverage problem
- Two variations of the minimum Steiner problem
- Optimizing phylogenetic diversity under constraints
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- The Noah's Ark Problem
- Symmetry and Approximability of Submodular Maximization Problems
- Non-monotone submodular maximization under matroid and knapsack constraints
This page was built for publication: Maximizing a submodular function with viability constraints
