Pages that link to "Item:Q1342235"
From MaRDI portal
The following pages link to On-line algorithms for weighted bipartite matching and stable marriages (Q1342235):
Displayed 44 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- 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)
- Size versus stability in the marriage problem (Q964402) (← 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)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Stable secretaries (Q1999964) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← 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)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← 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)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Online bottleneck matching (Q2436671) (← links)
- Local Matching Dynamics in Social Networks (Q3012913) (← links)
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability (Q3449578) (← links)
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
- Size Versus Stability in the Marriage Problem (Q3602826) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← 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)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online facility assignment (Q5919330) (← links)
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm (Q6051993) (← links)
- (Q6062163) (← links)
- Online 2-stage stable matching (Q6069183) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- Online Metric Algorithms with Untrusted Predictions (Q6075754) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- The online transportation problem (Q6102324) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)
- Online semi-matching problem with two heterogeneous sensors in a metric space (Q6113875) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)