On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Design of Competitive Online Algorithms via a Primal—Dual Approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Randomized Algorithms for Matching in the Online Preemptive Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved Bounds for Online Preemptive Matching / 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: 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 |
Latest revision as of 02:14, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Randomized Algorithms for Matching in the Online Preemptive Model |
scientific article |
Statements
On Randomized Algorithms for Matching in the Online Preemptive Model (English)
0 references
19 November 2015
0 references