Author

Sungsoo Na

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

    Determining a Regular n-Gon from Points on Distinct Sides

    A convex regular n-gon has four Euclidean degrees of freedom. Four generic distinguishable points in the plane lie on four distinct supporting side-lines of exactly (n − 1)(n − 2)(n − 3) geometric regular n-gons, one per injective assignment of the points to sides modulo a common...

    Zenodo (CERN European Organization for Nuclear Research)2026-08-220 citationsDOI
  • AI & ComputingOpen access

    Two Algebraic Thresholds for Relaxations of Stable Metric TSP

    Bilu–Linial stability asks whether an optimal solution remains uniquely optimal after every independent multiplicative increase of the input costs by a prescribed factor. For symmetric metric TSP, every 1.8-stable instance is solvable in polynomial time, and both the subtour rela...

    Zenodo (CERN European Organization for Nuclear Research)2026-08-090 citationsDOI
  • AI & ComputingOpen access

    Two Algebraic Thresholds for Relaxations of Stable Metric TSP

    Bilu–Linial stability asks whether an optimal solution remains uniquely optimal after every independent multiplicative increase of the input costs by a prescribed factor. For symmetric metric TSP, every 1.8-stable instance is solvable in polynomial time, and both the subtour rela...

    Zenodo (CERN European Organization for Nuclear Research)2026-08-090 citationsDOI
  • AI & ComputingOpen access

    Two Algebraic Thresholds for Relaxations of Stable Metric TSP

    Bilu–Linial stability asks whether an optimal solution remains uniquely optimal after every independent multiplicative increase of the input costs by a prescribed factor. For symmetric metric TSP, every 1.8-stable instance is solvable in polynomial time, and both the subtour rela...

    Zenodo (CERN European Organization for Nuclear Research)2026-08-090 citationsDOI