The following pages link to Online matching on a line (Q1770389):
Displaying 15 items.
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← 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)
- Improved lower bound for online strip packing (Q2344211) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- (Q5091241) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- (Q6062163) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)
