On-line algorithms for weighted bipartite matching and stable marriages
From MaRDI portal
(Redirected from Publication:1342235)
Cites work
Cited in
(55)- An optimal deterministic algorithm for online \(b\)-matching
- Minimum cost perfect matching with delays for two sources
- Improved bounds for randomized preemptive online matching
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Stable secretaries
- Improved online algorithms for knapsack and GAP in the random order model
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Greedy metric minimum online matchings with random arrivals
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online bottleneck matching
- The hospitals/residents problem with lower quotas
- Local matching dynamics in social networks
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Serve or skip: the power of rejection in online bottleneck matching
- Size Versus Stability in the Marriage Problem
- On the advice complexity of online bipartite matching and online stable marriage
- ``Almost stable matchings in the roommates problem with bounded preference lists
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Competitive analysis for two variants of online metric matching problem
- Impatient Online Matching
- Stochastic online metric matching
- Maintaining perfect matchings at low cost
- Dynamic stochastic matching under limited time
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- Minimum cost perfect matching with delays for two sources
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online facility assignment
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
- scientific article; zbMATH DE number 7758339 (Why is no real title available?)
- Online 2-stage stable matching
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- Online Metric Algorithms with Untrusted Predictions
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
- The online transportation problem
- Online bottleneck matching on a line
- Online semi-matching problem with two heterogeneous sensors in a metric space
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
- A randomized algorithm for online metric b-matching
- An optimal deterministic algorithm for online b-matching
- Online facility assignment for general layout of servers on a line
- Randomized algorithm for MPMD on two sources
- Capacity-insensitive algorithms for online facility assignment problems on a line
- Online metric matching on the line with recourse
- On the advice complexity of online matching on the line
- Maximum-utility popular matchings with bounded instability
- Matching on the line admits no \(o(\sqrt{\log n})\)-competitive algorithm
- Stochastic online metric matching: adversarial is no harder than stochastic
- \textsc{Permutation} for online metric matching with \(m\) distinct servers
- A nearly optimal deterministic algorithm for online transportation problem
- A randomized algorithm for the on-line weighted bipartite matching problem
- Size versus stability in the marriage problem
This page was built for publication: On-line algorithms for weighted bipartite matching and stable marriages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342235)
