A simple algorithm for computing Hamilton paths on independent set polytopes
These algorithms bypass solving the computationally intractable maximum weight independent set problem by solving the computationally intractable maximum weight independent set problem by a simple and purely combinatorial greedy rule.
Jean Cardinal, Pia Herkenrath, Torsten Mütze et al.
· 0 citations