A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q547301 / rank
Normal rank
 
Property / author
 
Property / author: Kirk R. Pruhs / rank
 
Normal rank
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.1007/978-3-030-86593-1_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201041086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of lower bounds for online matching on the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing of Temporary Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitively pricing parking in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing Online Decisions: Beyond Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic pricing of servers on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Metric Matching Problem for Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Weighted Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online algorithms for minimum metric bipartite matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116527 / rank
 
Normal rank

Latest revision as of 01:11, 29 July 2024

scientific article
Language Label Description Also known as
English
A poly-log competitive posted-price algorithm for online metrical matching on a spider
scientific article

    Statements

    A poly-log competitive posted-price algorithm for online metrical matching on a spider (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2022
    0 references

    Identifiers