We have discovered a new structural property of the ranking algorithm: if a node has two unmatched neighbors, then it will still be matched even when its rank ...

We prove the first non-trivial performance ratio strictly above 0.5 for the weighted Ranking algorithm on the oblivious matching problem where nodes in a ...

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity39:3. In this paper, we prove that a weighted version of Ranking ...

Using a new class of continuous linear programming (LP), we prove that the ratio for the weighted case is at least 0.501512, and we improve the ratio for the ...

We have discovered a new structural property of the ranking algorithm: if a node has two unmatched neighbors, then it will still be matched even when its rank ...

Abstract, We prove the first non-trivial performance ratio strictly above 0.5 for the weighted Ranking algorithm on the oblivious matching problem where ...

Bibliographic details on Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity.

2022. Analyzing node-weighted oblivious matching problem via continuous LP with jump discontinuity. THH Chan, F Chen, X Wu. ACM Transactions on Algorithms ...

Abstract. We prove the first non-trivial performance ratios strictly above 0.5 for weighted versions of the oblivious matching problem.

We prove the first non-trivial performance ratio strictly above 0.5 for the weighted Ranking algorithm on the oblivious matching problem where nodes in a ...