The following pages link to The Online Transportation Problem (Q4490792):
Displayed 13 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)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- An optimal deterministic algorithm for online \(b\)-matching (Q1575950) (← links)
- Online bottleneck semi-matching (Q2150569) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Online bottleneck matching (Q2436671) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm (Q6051993) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)