Search Results for author:
Found 2 papers, 1 papers with code
Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model
We show that assumptions in their analysis can be weakened, allowing us to replace their derivation of a crucial function $g$ on the unit square with a linear program that computes the values of a best possible $g$ under these assumptions on a discretized unit square.
Data Structures and Algorithms
Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time
Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
