Impatient Online Matching
From MaRDI portal
Recommendations
Cites work
- AdWords and generalized online matching
- Competitive randomized algorithms for nonuniform problems
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Min-cost bipartite perfect matching with delays
- Minimum cost perfect matching with delays for two sources
- On the advice complexity of online bipartite matching and online stable marriage
- On-line algorithms for weighted bipartite matching and stable marriages
- Online matching and ad allocation
- Online matching: haste makes waste!
- Online service with delay
- Online vertex-weighted bipartite matching and single-bid budgeted allocations
- Online Weighted Matching
- Paths, Trees, and Flowers
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- Randomized online algorithms for minimum metric bipartite matching
- Randomized primal-dual analysis of RANKING for online bipartite matching
Cited in
(11)- Competitive analysis for two variants of online metric matching problem
- Deterministic primal-dual algorithms for online k-way matching with delays
- Randomized algorithm for MPMD on two sources
- Capacity-insensitive algorithms for online facility assignment problems on a line
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online deterministic minimum cost bipartite matching with delays on a line
- Online matching with delays and stochastic arrival times
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online multi-level aggregation with delays and stochastic arrivals
- Online matching with delays and size-based costs
This page was built for publication: Impatient Online Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091056)
