PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Han, Qiaoming"

Author of the publication

copydeleteadd this publication to your clipboard
An improved rounding method and semidefinite programming relaxation for graph partition.

, , and . Math. Program., 92 (3): 509-535 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Liao Han University of Stuttgart

Qi Han

Udo-Ernst Haner University of Stuttgart

Dr. phil. Vanessa Hanke University of Stuttgart

Dr. Yuliya Hanesch University of Stuttgart

 

Other publications of authors with the same name

An edge-reduction algorithm for the vertex cover problem., , and . Oper. Res. Lett., 37 (3): 181-186 (2009)On approximation of max-vertex-cover., , , and . European Journal of Operational Research, 143 (2): 342-355 (2002)Revised filled function methods for global optimization., and . Applied Mathematics and Computation, 119 (2-3): 217-228 (2001)On the approximability of the vertex cover and related problems, and . CoRR, (2007)Strategy-proof mechanisms for obnoxious facility game with bounded service range., , , and . J. Comb. Optim., 37 (2): 737-755 (2019)On the Approximability of the Vertex Cover and Related Problems., and . AAIM, volume 6124 of Lecture Notes in Computer Science, page 161-169. Springer, (2010)An improved rounding method and semidefinite programming relaxation for graph partition., , and . Math. Program., 92 (3): 509-535 (2002)Improved approximations for max set splitting and max NAE SAT., , and . Discrete Applied Mathematics, 142 (1-3): 133-149 (2004)A polynomial time $3 2$ -approximation algorithm for the vertex cover problem on a class of graphs, , and . CoRR, (2007)A Hashing Power Allocation Game in Cryptocurrencies., , and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 226-238. Springer, (2018)