 | 2012 |
|---|
| 10 |       | Qiaoming Han,
Abraham P. Punnen:
Strong and weak edges of a graph and linkages with the vertex cover problem.
Discrete Applied Mathematics 160(3): 197-203 (2012) |
| 2010 |
|---|
| 9 | | Qiaoming Han,
Abraham P. Punnen:
On the Approximability of the Vertex Cover and Related Problems.
AAIM 2010: 161-169 |
| 2009 |
|---|
| 8 | | Qiaoming Han,
Abraham P. Punnen,
Yinyu Ye:
An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett. 37(3): 181-186 (2009) |
| 2008 |
|---|
| 7 | | Qiaoming Han,
Donglei Du,
Juan Carlos Vera,
Luis Fernando Zuluaga:
Improved Bounds for the Symmetric Rendezvous Value on the Line.
Operations Research 56(3): 772-782 (2008) |
| 2007 |
|---|
| 6 | | Qiaoming Han,
Donglei Du,
Juan Carlos Vera,
Luis Fernando Zuluaga:
Improved bounds for the symmetric rendezvous value on the line.
SODA 2007: 69-78 |
| 5 | | Qiaoming Han,
Abraham P. Punnen:
On the approximability of the vertex cover and related problems
CoRR abs/0712.3333: (2007) |
| 4 | | Qiaoming Han,
Abraham P. Punnen,
Yinyu Ye:
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR abs/0712.3335: (2007) |
| 2004 |
|---|
| 3 | | Jiawei Zhang,
Yinyu Ye,
Qiaoming Han:
Improved approximations for max set splitting and max NAE SAT.
Discrete Applied Mathematics 142(1-3): 133-149 (2004) |
| 2002 |
|---|
| 2 | | Qiaoming Han,
Yinyu Ye,
Hantao Zhang,
Jiawei Zhang:
On approximation of max-vertex-cover.
European Journal of Operational Research 143(2): 342-355 (2002) |
| 1 | | Qiaoming Han,
Yinyu Ye,
Jiawei Zhang:
An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program. 92(3): 509-535 (2002) |
Data released under the ODC-BY 1.0 license — See also our legal information page