Pages that link to "Item:Q2843268"

The following pages link to The Online Metric Matching Problem for Doubling Metrics (Q2843268):

Displaying 15 items.

• Fractal dimension and lower bounds for geometric problems (Q2039303) (← 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)
• 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)
• Stochastic Online Metric Matching (Q5091225) (← links)
• (Q5091241) (← links)
• (Q5116527) (← links)
• (Q5116530) (← 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)