Scenario Submodular Cover (Q2971162)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Scenario Submodular Cover	scientific article

Statements

scholarly article

0 references

Scenario Submodular Cover (English)

0 references

Nathaniel Grammel

0 references

Devorah Kletenik

0 references

0 references

Lisa Hellerstein

0 references

Approximation and Online Algorithms

0 references

publication date

4 April 2017

0 references

full work available at URL

https://arxiv.org/abs/1603.03158

0 references

MaRDI profile type

MaRDI publication profile

0 references

Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations

0 references

Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

0 references

0 references

Scenario Submodular Cover

0 references

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

0 references

Learning with attribute costs

0 references

0 references

Adaptive submodular ranking

0 references

Sequential testing of complex systems: a review

0 references

Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-51741-4_10

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971162

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971162&oldid=36313924"