Skip to content

Author

Yuchong Pan

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Better-Than-$3$ Approximation Algorithm for Demand Matching via Knapsack Intersection LP and Contention Resolution

The demand matching problem generalizes both the knapsack problem and the $b$-matching problem. In this problem, each edge of a graph has a demand and a weight, and each vertex has a capacity. The goal is to find a maximum weight subset of edges such that, at each vertex, the total demand of the incident selected edges...

M. Goemans, Yu-Chong Pan · 0 citations
Preprint Aug 2026

Bicriteria Approximation Algorithms for Demand Matching

An iterative relaxation algorithm for the demand matching problem that exploits a structural characterization of strictly fractional extreme points of the natural LP relaxation, which reduces the residual rounding problem to odd-cycle instances and gives a greedy, combinatorial $(k, 1)$-bicriteria approximation algorit...

Yu-Chong Pan, M. Goemans · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.