An optimal deterministic algorithm for online b-matching
From MaRDI portal
Recommendations
- Near optimal algorithms for online maximum weighted b-matching
- Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online Weighted Matching
- Deferred on-line bipartite matching
Cites work
Cited in
(50)- Near optimal algorithms for online weighted bipartite matching in adversary model
- Online algorithms for maximum cardinality matching with edge arrivals
- Collecting weighted items from a dynamic queue
- A stronger impossibility for fully online matching
- Learn from history for online bipartite matching
- Online crowdsourced truck delivery using historical information
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Improved online algorithms for jumbled matching
- Deterministic dynamic matching in \(O(1)\) update time
- Size versus fairness in the assignment problem
- Maximizing throughput in multi-queue switches
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Near optimal algorithms for online maximum weighted b-matching
- Tighter bounds for online bipartite matching
- A stochastic algorithm for online bipartite resource allocation problems
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Serve or skip: the power of rejection in online bottleneck matching
- On the lower bound of the competitive ratio for the weighted online roommates problem
- Online submodular welfare maximization: greedy beats 1/2 in random order
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Frequency capping in online advertising
- On policies for single-leg revenue management with limited demand information
- Online perfect matching and mobile computing
- Semi-online bipartite matching
- Online algorithms for maximum cardinality matching with edge arrivals
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- Online stochastic matching: new algorithms with better bounds
- Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
- Online stochastic weighted matching algorithm for real‐time shared parking
- Online bottleneck matching on a line
- Online allocation and display ads optimization with surplus supply
- An Optimal Algorithm for Online Freeze-tag
- Edge-weighted online bipartite matching
- An optimal deterministic algorithm for online b-matching
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online matching with stochastic rewards: advanced analyses using configuration linear programs
- Station assignment with reallocation
- Towards a practical, budget-oblivious algorithm for the adwords problem under small bids
- Online matching on 3-uniform hypergraphs
- Towards a practical, budget-oblivious algorithm for the adwords problem under small bids
- Tight bounds for online matching in bounded-degree graphs with vertex capacities
- Almost tight bounds for online hypergraph matching
- Optimal algorithms for online b-matching with variable vertex capacities
- Class fairness in online matching
- Near-optimal algorithm for supporting small and medium-sized enterprises in ad systems
- The greedy algorithm is not optimal for on-line edge coloring
- Leveraging reusability: improved competitive ratio of greedy for reusable resources
- Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
This page was built for publication: An optimal deterministic algorithm for online \(b\)-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575950)
