Chao Xu

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 28

Top Topics

Approximation Algorithms

Top Venues

Publications

Siyue Liu, Chao Xu
On the Congruency-Constrained Matroid Base. IPCO (2024)
Jingyang Zhao, Mingyu Xiao, Chao Xu
The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR (2024)
Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. 207 (1) (2024)
Yakun Chang, Chu Zhou, Yuchen Hong, Liwen Hu, Chao Xu, Tiejun Huang, Boxin Shi
1000 FPS HDR Video with a Spike-RGB Hybrid Camera. CVPR (2023)
Jianbo Wang, Chao Xu, Siyun Zhou
Solving Systems of Linear Equations Through Zero Forcing Set. COCOON (2) (2023)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197 (1) (2023)
Jingyang Zhao, Mingyu Xiao, Chao Xu
Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS (2022)
Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
Hypergraph k-cut in randomized polynomial time. Math. Program. 186 (1) (2021)
Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. Eur. J. Oper. Res. 289 (2) (2021)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM (2020)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR (2020)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34 (2) (2020)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Beating the 2-approximation factor for global bicut. Math. Program. 177 (1-2) (2019)
Konstantinos Koiliaris, Chao Xu
Faster Pseudopolynomial Time Algorithms for Subset Sum. ACM Trans. Algorithms 15 (3) (2019)
Chandra Chekuri, Chao Xu
Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. 47 (6) (2018)
Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
-Cut in Randomized Polynomial Time. SODA (2018)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR (2018)
Konstantinos Koiliaris, Chao Xu
Subset Sum Made Simple. CoRR (2018)
Chao Xu, Qian Zhang
The shortest kinship description problem. Inf. Process. Lett. 138 (2018)
Chandra Chekuri, Chao Xu
A note on approximate strengths of edges in a hypergraph. CoRR (2017)
Konstantinos Koiliaris, Chao Xu
A Faster Pseudopolynomial Time Algorithm for Subset Sum. SODA (2017)
Chandra Chekuri, Chao Xu
Computing minimum cuts in hypergraphs. SODA (2017)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM (2017)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and fixed-terminal cuts in digraphs. CoRR (2016)
Chandra Chekuri, Chao Xu
Computing minimum cuts in hypergraphs. CoRR (2016)
Chao Xu
Reconstructing edge-disjoint paths faster. Oper. Res. Lett. 44 (2) (2016)
Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu
On Element-Connectivity Preserving Graph Simplification. ESA (2015)
Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. SODA (2015)
Konstantinos Koiliaris, Chao Xu
A Faster Pseudopolynomial Time Algorithm for Subset Sum. CoRR (2015)
Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. CoRR (2014)