Junho Hwang

collaborators

2 papers

cs.DS2026

An EPTAS for Vector Scheduling with Time Intervals

Junho Hwang

We study vector scheduling in which each job is active during a fixed time interval. A job uses several resources and stays on one machine for its entire interval; its resource req…

cs.DS2026

A 5/4 bound for graphic $s$ - $t$ path TSP on subcubic graphs

Junho Hwang

We study the graphic $s$ - $t$ path TSP on subcubic graphs (maximum degree 3): given distinct vertices $s, t$ , find a shortest $s$ - $t$ walk that visits every vertex. We prove an upper…

An EPTAS for Vector Scheduling with Time Intervals

A 5/4 bound for graphic s-t path TSP on subcubic graphs

A 5/4 bound for graphic $s$ - $t$ path TSP on subcubic graphs