2 papers
cs.GT2026
Fair Transit Stop Placement: A Clustering Perspective and Beyond
Haris Aziz, Ling Gai, Yuhang Guo +1
We study the transit stop placement (TrSP) problem in general metric spaces, where agents travel between source-destination pairs and may either walk directly or utilize a shuttle…
cs.DS2024
Minimum sum vertex cover: kernelization and parameterized algorithms
Yixin Cao, Ling Gai, Jingyi Liu +1
Given an ordering of the vertices of a graph, the cost of covering an edge is the smaller number of its two ends. The minimum sum vertex cover problem asks for an ordering that min…