Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints

DOI10.1137/1.9781611973402.82zbMath1421.68109arXiv1307.2696OpenAlexW2951973862MaRDI QIDQ5384044

No author found.

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2696

zbMATH Keywords

maximum matchingprimal-dual methodscontinuous linear programmingoblivious algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20)

Related Items (4)

Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching ⋮ Unnamed Item ⋮ Greedy matching: guarantees and limitations ⋮ Online Vertex-Weighted Bipartite Matching

This page was built for publication: Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints