The following pages link to Online Weighted Matching (Q4696653):
Displayed 46 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)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space (Q1336762) (← links)
- On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
- An optimal deterministic algorithm for online \(b\)-matching (Q1575950) (← links)
- Minimum cost perfect matching with delays for two sources (Q1628601) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
- A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Online bottleneck matching (Q2436671) (← links)
- Online minimum matching with uniform metric and random arrivals (Q2670469) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Randomized algorithms for the on-line minimum matching problem on euclidean space (Q4876378) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Online Matching in Regular Bipartite Graphs (Q5087843) (← links)
- Impatient Online Matching (Q5091056) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- (Q5091241) (← links)
- Dynamic Stochastic Matching Under Limited Time (Q5106373) (← links)
- (Q5116527) (← links)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- Dynamic pricing of servers on trees (Q5875461) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- Online facility assignment (Q5919330) (← links)
- Two online algorithms for the ambulance systems (Q5945843) (← links)
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm (Q6051993) (← links)
- (Q6062163) (← links)
- Online Metric Algorithms with Untrusted Predictions (Q6075754) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- Algorithms for online car-sharing problem (Q6102279) (← links)
- The online transportation problem (Q6102324) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- Online Matching in Regular Bipartite Graphs with Randomized Adversary (Q6163632) (← links)