The advice complexity of a class of hard online problems (Q1693995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Online Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Advice and Randomization for the Disjoint Path Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online coloring of bipartite graphs with and without advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string guessing problem as a method to prove lower bounds on the advice complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem: advice and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list update problem with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin packing with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line vertex-covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice complexity of maximum independent set in sparse and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the problem-relevant information in input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of Online Coloring for Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Advice Complexity of the k-server Problem under Sparse Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Online Edge Coloring of Planar Graphs with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advice complexity of online bipartite matching and online stable marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice for bin packing and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of the Online Coloring Problem / rank
 
Normal rank

Latest revision as of 01:54, 15 July 2024

scientific article
Language Label Description Also known as
English
The advice complexity of a class of hard online problems
scientific article

    Statements

    The advice complexity of a class of hard online problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    advice complexity
    0 references
    complexity class
    0 references
    asymmetric string guessing
    0 references
    covering designs
    0 references
    asymmetric online covering (AOC)
    0 references
    0 references
    0 references
    0 references
    0 references