28 citations · 55 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Maximum Cut Algorithms and Upper Bounds for Planar and Toroidal Graphs
Mark Glass, Meir Feder
We demonstrate that the problem of finding the maximum cut of a planar graph with arbitrary weights can be easily mapped to a minimum T-join problem in the absolute dual graph - th…
cond-mat.stat-mech2026
Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization
Khen Cohen, Mark Glass, Meir Feder +1
We introduce a physics-inspired continuous relaxation framework that yields substantially improved solutions for NP-hard combinatorial optimization problems, including Quadratic Un…