Pages that link to "Item:Q476428"
From MaRDI portal
The following pages link to A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428):
Displaying 14 items.
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← links)
- Online bottleneck semi-matching (Q2150569) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Online minimum matching with uniform metric and random arrivals (Q2670469) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- Online facility assignment (Q5919330) (← links)
- (Q6062163) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- A randomized algorithm for online metric b-matching (Q6556181) (← links)
- Randomized algorithm for MPMD on two sources (Q6609154) (← links)
