Pages that link to "Item:Q5896931"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896931):
Displaying 21 items.
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- Online matching on a line (Q1770389) (← links)
- 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)
- The Online Metric Matching Problem for Doubling Metrics (Q2843268) (← links)
- Greedy Matching on the Line (Q3474883) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Online perfect matching and mobile computing (Q5057433) (← links)
- (Q5116527) (← links)
- On-line selection of an acceptable pair (Q5754683) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- Online facility assignment (Q5919330) (← 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)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6591637) (← links)
- An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line (Q6606163) (← links)
- Dynamic Euclidean bottleneck matching (Q6612538) (← links)
- Capacity-insensitive algorithms for online facility assignment problems on a line (Q6637060) (← links)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6658298) (← links)
