Ranking on arbitrary graphs: rematch via continuous linear programming
DOI10.1137/140984051zbMATH Open1398.68400OpenAlexW2886153187WikidataQ129418969 ScholiaQ129418969MaRDI QIDQ4581907FDOQ4581907
Authors: T-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao 
Publication date: 21 August 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140984051
Recommendations
- Ranking on arbitrary graphs: rematch via continuous LP with monotone and boundary condition constraints
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Tighter bounds for online bipartite matching
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Online bipartite matching with unknown distributions
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A class of continuous linear programming problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Title not available (Why is that?)
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Title not available (Why is that?)
- Pairwise kidney exchange
- Randomized greedy matching
- Randomized greedy matching. II
- Title not available (Why is that?)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- Beating ratio 0.5 for weighted oblivious matching problems
- Online matroid intersection: beating half for random arrival
Cited In (1)
This page was built for publication: Ranking on arbitrary graphs: rematch via continuous linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581907)
