Submodular learning and covering with response-dependent costs (Q1663646): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Merged Item from Q2830272 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3112637 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2933908 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Trading off Worst and Expected Cost in Decision Tree Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating decision trees with value dependent testing costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank | |||
Normal rank | |||
Revision as of 21:32, 12 July 2024
scientific article; zbMATH DE number 6650167
- Submodular Learning and Covering with Response-Dependent Costs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Submodular learning and covering with response-dependent costs |
scientific article; zbMATH DE number 6650167 |
|
Statements
Submodular learning and covering with response-dependent costs (English)
0 references
Submodular Learning and Covering with Response-Dependent Costs (English)
0 references
22 August 2018
0 references
9 November 2016
0 references
interactive learning
0 references
submodular functions
0 references
outcome costs
0 references
