Submodular learning and covering with response-dependent costs (Q1663646): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Submodular Learning and Covering with Response-Dependent Costs
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6650167
@@ Property / DOI @@
-.1016/j.tcs.2017.12.033
@@ Property / DOI: 10.1016/j.tcs.2017.12.033 / rank @@
-Normal rank
@@ Property / title @@
+Submodular Learning and Covering with Response-Dependent Costs (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68455
@@ Property / zbMATH Open document ID: 1398.68455 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-46379-7_9
@@ Property / DOI: 10.1007/978-3-319-46379-7_9 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2017.12.033
@@ Property / DOI: 10.1016/J.TCS.2017.12.033 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+November 2016Timestamp +2016-11-09T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-11-09T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 9 November 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6650167
@@ Property / zbMATH DE Number: 6650167 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963626143
@@ Property / OpenAlex ID: W2963626143 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q3112637
@@ Property / cites work: Q3112637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2933908
@@ Property / cites work: Q2933908 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Trading off Worst and Expected Cost in Decision Tree Problems
+Normal rank
@@ Property / cites work @@
+Approximating decision trees with value dependent testing costs
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Submodular functions and electrical networks
@@ Property / cites work: Submodular functions and electrical networks / rank @@
+Normal rank

Latest revision as of 05:28, 28 December 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	Submodular Learning and Covering with Response-Dependent Costs