scientific article; zbMATH DE number 7236471
From MaRDI portal
Publication:5116527
DOI10.4230/LIPICS.SOCG.2018.67zbMATH Open1489.68408arXiv1803.07206MaRDI QIDQ5116527FDOQ5116527
Authors: Sharath Raghvendra 
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1803.07206
Title of this publication is not available (Why is that?)
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
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cites Work
- On-line algorithms for weighted bipartite matching and stable marriages
- Competitive algorithms for server problems
- On the k -server conjecture
- Online Weighted Matching
- Approximation and Online Algorithms
- The Online Metric Matching Problem for Doubling Metrics
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A robust and optimal online algorithm for minimum metric bipartite matching
Cited In (23)
- Title not available (Why is that?)
- 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
- Online facility assignment for general layout of servers on a line
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
- A robust and optimal online algorithm for minimum metric bipartite matching
- Stochastic online metric matching
- A collection of lower bounds for online matching on the line
- Online scheduling of car-sharing request pairs between two locations
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online bottleneck matching on a line
- Online request server matching
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- Online minimum matching with uniform metric and random arrivals
- 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 matching 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)
