Online multi-coloring with advice (Q2355706): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On paging with locality of reference / 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: On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles / 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: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the accommodating function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seat reservation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accommodating Function: A Generalization of the Competitive Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute and asymptotic bounds for online frequency allocation in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency Allocation Problems for Linear Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online multi-coloring on the path revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds for incremental frequency allocation in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three results on frequency assignment in linear cellular networks / 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: On the Advice Complexity of Buffer Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / 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: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Online Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / 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: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of the Online Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747413 / rank
 
Normal rank

Latest revision as of 13:00, 10 July 2024

scientific article
Language Label Description Also known as
English
Online multi-coloring with advice
scientific article

    Statements

    Online multi-coloring with advice (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2015
    0 references
    advice complexity
    0 references
    graph multi-coloring
    0 references
    frequency allocation
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    0 references
    0 references

    Identifiers