Scenario submodular cover

Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We introduce the Scenario Submodular Cover problem. In this problem, the goal is to produce a cover with minimum expected cost, with respect to an empirical joint probability distribution, given as input by a weighted sample of realizations. The problem is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause [6], which assumes independent variables. We give two approximation algorithms for Scenario Submodular Cover. Assuming an integervalued utility function and integer weights, the first achieves an approximation factor of O(logQm), where m is the sample size and Q is the goal utility. The second, simpler algorithm achieves an approximation factor of O(logQW), where W is the sum of the weights. We achieve our bounds by building on previous related work (in [4,6,15]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.

    Original languageEnglish (US)
    Title of host publicationApproximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers
    PublisherSpringer Verlag
    Pages116-128
    Number of pages13
    Volume10138 LNCS
    ISBN (Print)9783319517407
    DOIs
    StatePublished - 2017
    Event14th International Workshop on Approximation and Online Algorithms, WAOA 2016 - Aarhus, Denmark
    Duration: Aug 25 2016Aug 26 2016

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10138 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other14th International Workshop on Approximation and Online Algorithms, WAOA 2016
    CountryDenmark
    CityAarhus
    Period8/25/168/26/16

    Fingerprint

    Cover
    Scenarios
    Boolean functions
    Function evaluation
    Approximation algorithms
    Probability distributions
    Costs
    Approximation
    Boolean Functions
    Utility Function
    Joint Distribution
    Approximation Algorithms
    Sample Size
    Probability Distribution
    Integer
    Evaluation

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Grammel, N., Hellerstein, L., Kletenik, D., & Lin, P. (2017). Scenario submodular cover. In Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers (Vol. 10138 LNCS, pp. 116-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10138 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51741-4_10

    Scenario submodular cover. / Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah; Lin, Patrick.

    Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Vol. 10138 LNCS Springer Verlag, 2017. p. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10138 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Grammel, N, Hellerstein, L, Kletenik, D & Lin, P 2017, Scenario submodular cover. in Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. vol. 10138 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10138 LNCS, Springer Verlag, pp. 116-128, 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, Aarhus, Denmark, 8/25/16. https://doi.org/10.1007/978-3-319-51741-4_10
    Grammel N, Hellerstein L, Kletenik D, Lin P. Scenario submodular cover. In Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Vol. 10138 LNCS. Springer Verlag. 2017. p. 116-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-51741-4_10
    Grammel, Nathaniel ; Hellerstein, Lisa ; Kletenik, Devorah ; Lin, Patrick. / Scenario submodular cover. Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Vol. 10138 LNCS Springer Verlag, 2017. pp. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{5d3779d938be4347bfec471e2421deed,
    title = "Scenario submodular cover",
    abstract = "We introduce the Scenario Submodular Cover problem. In this problem, the goal is to produce a cover with minimum expected cost, with respect to an empirical joint probability distribution, given as input by a weighted sample of realizations. The problem is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause [6], which assumes independent variables. We give two approximation algorithms for Scenario Submodular Cover. Assuming an integervalued utility function and integer weights, the first achieves an approximation factor of O(logQm), where m is the sample size and Q is the goal utility. The second, simpler algorithm achieves an approximation factor of O(logQW), where W is the sum of the weights. We achieve our bounds by building on previous related work (in [4,6,15]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.",
    author = "Nathaniel Grammel and Lisa Hellerstein and Devorah Kletenik and Patrick Lin",
    year = "2017",
    doi = "10.1007/978-3-319-51741-4_10",
    language = "English (US)",
    isbn = "9783319517407",
    volume = "10138 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "116--128",
    booktitle = "Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers",
    address = "Germany",

    }

    TY - GEN

    T1 - Scenario submodular cover

    AU - Grammel, Nathaniel

    AU - Hellerstein, Lisa

    AU - Kletenik, Devorah

    AU - Lin, Patrick

    PY - 2017

    Y1 - 2017

    N2 - We introduce the Scenario Submodular Cover problem. In this problem, the goal is to produce a cover with minimum expected cost, with respect to an empirical joint probability distribution, given as input by a weighted sample of realizations. The problem is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause [6], which assumes independent variables. We give two approximation algorithms for Scenario Submodular Cover. Assuming an integervalued utility function and integer weights, the first achieves an approximation factor of O(logQm), where m is the sample size and Q is the goal utility. The second, simpler algorithm achieves an approximation factor of O(logQW), where W is the sum of the weights. We achieve our bounds by building on previous related work (in [4,6,15]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.

    AB - We introduce the Scenario Submodular Cover problem. In this problem, the goal is to produce a cover with minimum expected cost, with respect to an empirical joint probability distribution, given as input by a weighted sample of realizations. The problem is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause [6], which assumes independent variables. We give two approximation algorithms for Scenario Submodular Cover. Assuming an integervalued utility function and integer weights, the first achieves an approximation factor of O(logQm), where m is the sample size and Q is the goal utility. The second, simpler algorithm achieves an approximation factor of O(logQW), where W is the sum of the weights. We achieve our bounds by building on previous related work (in [4,6,15]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.

    UR - http://www.scopus.com/inward/record.url?scp=85010695278&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85010695278&partnerID=8YFLogxK

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

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

    M3 - Conference contribution

    SN - 9783319517407

    VL - 10138 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 116

    EP - 128

    BT - Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers

    PB - Springer Verlag

    ER -