scientific article; zbMATH DE number 7236471
From MaRDI portal
Publication:5116527
Recommendations
- An optimal deterministic algorithm for online \(b\)-matching
- Approximation and Online Algorithms
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A polyhedral approach to online bipartite matching
- A Polyhedral Approach to Online Bipartite Matching
- Near optimal algorithms for online maximum weighted b-matching
Cites work
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A robust and optimal online algorithm for minimum metric bipartite matching
- Approximation and Online Algorithms
- Competitive algorithms for server problems
- On the k -server conjecture
- On-line algorithms for weighted bipartite matching and stable marriages
- Online Weighted Matching
- The Online Metric Matching Problem for Doubling Metrics
Cited in
(29)- Online matching on a line
- Online deterministic minimum cost bipartite matching with delays on a line
- scientific article; zbMATH DE number 7758339 (Why is no real title available?)
- Online metric matching on the line with recourse
- Approximation and Online Algorithms
- Online semi-matching problem with two heterogeneous sensors in a metric space
- Online Metric Algorithms with Untrusted Predictions
- Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Online facility assignment for general layout of servers on a line
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
- Online scheduling of car-sharing request pairs between two locations
- A collection of lower bounds for online matching on the line
- A robust and optimal online algorithm for minimum metric bipartite matching
- Stochastic online metric matching
- Matching on the line admits no \(o(\sqrt{\log n})\)-competitive algorithm
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Online bottleneck matching on a line
- Online request server matching
- Improved online sorting
- Online minimum matching with uniform metric and random arrivals
- Online sorting and online TSP: Randomized, stochastic, and high-dimensional
- Competitive analysis for two variants of online metric matching problem
- Capacity-insensitive algorithms for online facility assignment problems on a line
- Greedy metric minimum online matchings with random arrivals
- Online bottleneck semi-matching
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
- Online deterministic minimum cost bipartite matching with delays on a line
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116527)
