Hao Sun

Postdoctoral Fellow, Faculty of Science - Computing Science


Postdoctoral Fellow, Faculty of Science - Computing Science


Area of Study / Keywords

Combinatorial Optimization Approximation Algorithms Feedback Vertex Set


1. Hao Sun A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of BoundedGenus https://arxiv.org/submit/5211117 Submitted to IPCO 2024

2. Zachary Friggstad, Mohsen Rezapour, Mohammad Salavatipour and Hao Sun A QPTAS for FacilityLocation on Unit Disk graphs Submitted to STACS 2024

3. Alexander Göke, Jochen Koenemann, Matthias Mnich, Hao Sun Hitting Weighted Even Cycles inPlanar Graphs APPROX 2021 https://drops.dagstuhl.de/opus/volltexte/2021/14718/pdf/LIPIcs-APPROX25.pdf. Also submitted to SIDMA.

4. Hao Sun An improved approximation bound for minimum weight dominating set on graphs ofbounded arboricity In: Koenemann, J., Peis, B. (eds) Approximation and Online Algorithms. WAOA2021. Lecture Notes in Computer Science(), vol 12982. Springer, Cham.

5. Li, X., Pong, T.K., Sun, H. Wolkowicz, H. A strictly contractive Peaceman-Rachford splitting methodfor the doubly nonnegative relaxation of the minimum cut problem. Comput Optim Appl 78, 853–891(2021). https://doi.org/10.1007/s10589-020-00261-4

6. Jim Geelen, Hao Sun, A proof of Rado’s Theorem via principal extension, Advances in Applied Math-ematics, 2020, 102013, ISSN 0196-8858, https://doi.org/10.1016/j.aam.2020.102013.

7. Hao Sun (2016). ADMM for SDP Relaxation of GP. UWSpace. http://hdl.handle.net/10012/10727

8. Ting Kei Pong, Hao Sun, Ningchuan Wang, Henry Wolkowicz Eigenvalue, quadratic programming,and semidefinite programming relaxations for a cut minimization problem. Comput. Optim. Appl.63(2): 333-364 (2016)