Adaptive Submodular Ranking and Routing (Q5130512): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3015734538 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.01530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating optimal binary decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple intents re-ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When LP is the cure for your matching woes: improved bounds for stochastic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polymatroid Steiner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision trees for entity identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario Submodular Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Active Learning with Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive and non-preemptive generalized min sum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Latency Submodular Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive submodular ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Informative Sensing using Multiple Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the generalized min-sum set cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank

Latest revision as of 00:12, 24 July 2024

scientific article; zbMATH DE number 7269930
Language Label Description Also known as
English
Adaptive Submodular Ranking and Routing
scientific article; zbMATH DE number 7269930

    Statements

    Adaptive Submodular Ranking and Routing (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2020
    0 references
    submodularity
    0 references
    stochastic optimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references