PTAS for the minimum k-path connected vertex cover problem in unit disk graphs

Handbook of applied cryptography

Choice Reviews Online · 1997 · 10.5K citations · Full text

Computing, Computer Science, Computer Security +16

A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

Xiuzhen Cheng, Xiao Huang, Deying Li et al. · Networks · 2003 · 333 citations

Computing, Computer Science, Computer Networks +13

Minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path vertex cover

Boštjan Brešar, František Kardoš, Ján Katrenič et al. · Discrete Applied Mathematics · 2011 · 166 citations · Full text

Natural Sciences, Computer Science, Mathematics +8

A factor 2 approximation algorithm for the vertex cover problem

Jianhua Tu, Wenli Zhou · Information Processing Letters · 2011 · 63 citations

Computing, Computer Science, Mathematics +11

An approximation scheme for some Steiner tree problems in the plane

Lusheng Wang, Tao Jiang · Networks · 1996 · 19 citations

Computing, Computer Science, Mathematics +15