Call admission problems on trees (Q2672603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4229460063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128890 / 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: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The advice complexity of a class of hard online problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call admission problems on trees with advice (extended abstract) / 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: A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Randomness versus Advice in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice: the tape model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call admission problems on grids with advice (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-Weighted Disjoint Path Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recursions Connected With Symmetric Groups I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Path Allocation with Sublinear Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Topological Indices in Combinatorial Chemistry / rank
 
Normal rank

Latest revision as of 07:45, 29 July 2024

scientific article
Language Label Description Also known as
English
Call admission problems on trees
scientific article

    Statements

    Call admission problems on trees (English)
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    disjoint path allocation
    0 references
    call admission
    0 references
    advice complexity
    0 references
    competitive analysis
    0 references

    Identifiers