scientific article; zbMATH DE number 7236471
From MaRDI portal
Publication:5116527
DOI10.4230/LIPIcs.SoCG.2018.67zbMath1489.68408arXiv1803.07206MaRDI QIDQ5116527
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1803.07206
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (14)
A poly-log competitive posted-price algorithm for online metrical matching on a spider ⋮ Online bottleneck semi-matching ⋮ Online scheduling of car-sharing request pairs between two locations ⋮ Online minimum matching with uniform metric and random arrivals ⋮ A \(o(n)\)-competitive deterministic algorithm for online matching on a line ⋮ Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm ⋮ Online Metric Algorithms with Untrusted Predictions ⋮ 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 ⋮ Unnamed Item ⋮ Competitive analysis for two variants of online metric matching problem ⋮ Greedy metric minimum online matchings with random arrivals ⋮ Stochastic Online Metric Matching
Cites Work
- On-line algorithms for weighted bipartite matching and stable marriages
- The Online Metric Matching Problem for Doubling Metrics
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line
- Competitive algorithms for server problems
- On the k -server conjecture
- A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
- Online Weighted Matching
- Approximation and Online Algorithms
This page was built for publication:
