Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming
From MaRDI portal
Publication:4581907
DOI10.1137/140984051zbMath1398.68400MaRDI QIDQ4581907
T-H. Hubert Chan, Fei Chen, Zhichao Zhao, Xiaowei Wu
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
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W20: Randomized algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairwise kidney exchange
- Online matroid intersection: beating half for random arrival
- A class of continuous linear programming problems
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- Randomized greedy matching
- Randomized greedy matching. II
- Beating ratio 0.5 for weighted oblivious matching problems
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- A Duality Theorem for a Class of Continuous Linear Programming Problems