Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time
1 version
ZK
Zhuan Khye Koh
cs.DSmath.OCcs.DMcs.GTmath.CO05C05 Trees05C57 Games on graphs (graph-theoretic aspects)91A12 Cooperative gamescs.LO
On Valency
published · living versionsPreprints & journals
10 papers in the corpus · 2017–2026Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time
0 citations
On Circuit Diameter and Straight Line Complexity
0 citations
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
1 citation
On the correlation gap of matroids.
0 citations
Online Matching on -Uniform Hypergraphs
1 citation
On Circuit Diameter Bounds via Circuit Imbalances
4 citations
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
2 citations
An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems
3 citations
An efficient characterization of submodular spanning tree games.
5 citations
Stabilizing Weighted Graphs
5 citations
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.