Pages that link to "Item:Q3453279"

The following pages link to A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279):

Displaying 8 items.

• A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← 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)
• Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
• Stochastic Online Metric Matching (Q5091225) (← links)
• (Q5116527) (← links)
• Deterministic min-cost matching with delays (Q5916084) (← links)
• Online facility assignment (Q5919330) (← links)