Linqing Tang

According to our database, Linqing Tang authored at least 11 papers between 2008 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Minimum Label <i>s</i>-<i>t</i> Cut has large integrality gaps.

Peng Zhang, Linqing Tang

Inf. Comput., 2020

2019

Minimum Label s-t Cut has Large Integrality Gaps.

Peng Zhang, Linqing Tang

CoRR, 2019

2018

Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem.

Peng Zhang, Bin Fu, Linqing Tang

Algorithmica, 2018

2012

Approximating Minimum Label s-t Cut via Linear Programming.

Linqing Tang, Peng Zhang

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

On the derandomization of the graph test for homomorphism over groups.

Linqing Tang

Theor. Comput. Sci., 2011

Approximation and hardness results for label cut and related problems.

Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao

J. Comb. Optim., 2011

The Complexity and Approximability of Minimum Contamination Problems.

Angsheng Li, Linqing Tang

Proceedings of the Theory and Applications of Models of Computation, 2011

2009

Principal filters definable by parameters in E_bT.

Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang

Math. Struct. Comput. Sci., 2009

Conditional Hardness of Approximating Satisfiable Max 3CSP-<i>q</i>.

Linqing Tang

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Derandomizing Graph Tests for Homomorphism.

Angsheng Li, Linqing Tang

Proceedings of the Theory and Applications of Models of Computation, 2008

Definable Filters in the Structure of Bounded Turing Reductions.

Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang

Proceedings of the Theory and Applications of Models of Computation, 2008