Online Weighted Matching
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176778
- Online stochastic weighted matching: improved approximation algorithms
- A randomized algorithm for the on-line weighted bipartite matching problem
- Near optimal algorithms for online maximum weighted b-matching
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
Cited in
(75)- Online matching with blocked input
- Some recent results in the analysis of greedy algorithms for assignment problems
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space
- On-line algorithms for weighted bipartite matching and stable marriages
- An optimal deterministic algorithm for online \(b\)-matching
- Minimum cost perfect matching with delays for two sources
- Near optimal algorithms for online weighted bipartite matching in adversary model
- Improved bounds for randomized preemptive online matching
- On-line weighted pattern matching
- The fast algorithm for online \(k\)-server problem on trees
- 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
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Greedy metric minimum online matchings with random arrivals
- Maximum matching on trees in the online preemptive and the incremental graph models
- 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
- Online minimum matching with uniform metric and random arrivals
- Dynamic weighted matching with heterogeneous arrival and departure rates
- Weighted Online Problems with Advice
- Online bipartite matching with decomposable weights
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
- Near optimal algorithms for online maximum weighted b-matching
- On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Serve or skip: the power of rejection in online bottleneck matching
- Weighted Matching in Chess Tournaments
- Competitive Weighted Matching in Transversal Matroids
- On the lower bound of the competitive ratio for the weighted online roommates problem
- scientific article; zbMATH DE number 176778 (Why is no real title available?)
- Beating ratio 0.5 for weighted oblivious matching problems
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Randomized algorithms for the on-line minimum matching problem on euclidean space
- Competitive analysis for two variants of online metric matching problem
- Online perfect matching and mobile computing
- Online matching in regular bipartite graphs
- 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?)
- An optimal truthful mechanism for the online weighted bipartite matching problem
- Minimum cost perfect matching with delays for two sources
- On-line selection of an acceptable pair
- Dynamic pricing of servers on trees
- Online facility assignment
- Two online algorithms for the ambulance systems
- Online request server matching
- 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 Metric Algorithms with Untrusted Predictions
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
- Algorithms for online car-sharing problem
- The online transportation problem
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- A randomized algorithm for online metric b-matching
- An optimal deterministic algorithm for online b-matching
- An O( n)-competitive posted-price algorithm for online matching on the line
- Online facility assignment for general layout of servers on a line
- Randomized algorithm for MPMD on two sources
- Time efficient implementation for online k-server problem on trees
- Capacity-insensitive algorithms for online facility assignment problems on a line
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Online metric matching on the line with recourse
- On the advice complexity of online matching on the line
- Estimating the expected social welfare and cost of random serial dictatorship
- 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
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
- Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
This page was built for publication: Online Weighted Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4696653)
