Pages that link to "Item:Q1575950"
From MaRDI portal
The following pages link to An optimal deterministic algorithm for online \(b\)-matching (Q1575950):
Displaying 29 items.
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- 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)
- Frequency capping in online advertising (Q490332) (← links)
- Station assignment with reallocation (Q666668) (← links)
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- Online algorithms for maximum cardinality matching with edge arrivals (Q1741843) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- A stronger impossibility for fully online matching (Q2060387) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Maximizing throughput in multi-queue switches (Q2369876) (← links)
- Tighter Bounds for Online Bipartite Matching (Q3295268) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- On Policies for Single-Leg Revenue Management with Limited Demand Information (Q4994151) (← links)
- (Q5090428) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Online stochastic weighted matching algorithm for real‐time shared parking (Q6080597) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)
- Edge-weighted online bipartite matching (Q6551261) (← links)
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue (Q6602240) (← links)
- Online matching with stochastic rewards: advanced analyses using configuration linear programs (Q6609158) (← links)
