2 papers
cs.DS2025
Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
Jingyang Zhao, Zimo Sheng, Mingyu Xiao
The Traveling Salesman Problem (TSP) is a classic and extensively studied problem with numerous real-world applications in artificial intelligence and operations research. It is we…
cs.DS2025
New Algorithms for #2-SAT and #3-SAT
Junqiang Peng, Zimo Sheng, Mingyu Xiao
The #2-SAT and #3-SAT problems involve counting the number of satisfying assignments (also called models) for instances of 2-SAT and 3-SAT, respectively. In 2010, Zhou et al. propo…