collaborators

1 paper

cond-mat.dis-nn2018

Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension

Sergio Caracciolo, Andrea Di Gioacchino, Enrico M. Malatesta

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen a…