Pages that link to "Item:Q2294680"
From MaRDI portal
The following pages link to A collection of lower bounds for online matching on the line (Q2294680):
Displayed 7 items.
- A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm (Q6051993) (← links)
- (Q6062163) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)