Eleonora Vercesi
@eleonoravercesi.bsky.social
(she/her)👩🏻💻 PostDoc @ USI - IDSIA (USI - SUPSI)
My interests include environment, rights, science, and (NP) hard problems
https://eleonoravercesi.github.io
My interests include environment, rights, science, and (NP) hard problems
https://eleonoravercesi.github.io
Last, Tullio is presenting new insight on the 4/3 conjecture for the metric Traveling Salesman Problem 🤩
May 27, 2025 at 11:33 AM
Last, Tullio is presenting new insight on the 4/3 conjecture for the metric Traveling Salesman Problem 🤩
Koppány follows by presenting our ICALP ‘25 paper on interpreting branch and bound as PTAS, showing the importance of node selection and lower bound for make this type of algorithms very efficient, even in practice!
May 27, 2025 at 9:28 AM
Koppány follows by presenting our ICALP ‘25 paper on interpreting branch and bound as PTAS, showing the importance of node selection and lower bound for make this type of algorithms very efficient, even in practice!
From our group, Stefano starts by presenting how hard is to find counterexamples for heuristics from the perspective of a theoretical computer scientist
May 27, 2025 at 9:25 AM
From our group, Stefano starts by presenting how hard is to find counterexamples for heuristics from the perspective of a theoretical computer scientist