Improved bounds for randomized preemptive online matching (Q1706142): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / 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, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buyback Problem - Approximate Matroid Intersection with Cancellation Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitiveness of on-line real-time task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient On-Line Call Control Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved randomized results for the interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of jobs with fixed start times on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming in the semi-streaming model with application to the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted matching in the semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online interval scheduling: Randomized and multiprocessor cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental medians via online bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online-list batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for scheduling conflicting jobs with minsum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sum coloring in batch scheduling of conflicting jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for online bounded bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a local protocol for concurrent file transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: 75.9 Euler’s Constant / rank
 
Normal rank

Latest revision as of 08:02, 15 July 2024

scientific article
Language Label Description Also known as
English
Improved bounds for randomized preemptive online matching
scientific article

    Statements

    Improved bounds for randomized preemptive online matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 March 2018
    0 references
    online matching
    0 references
    competitive analysis
    0 references
    lower bounds
    0 references
    0 references
    0 references

    Identifiers