Hits :

First Author : Zhao Zhang

Date of Publication : 2017-01-01

Journal : Information Processing Letters

Affiliation of Author(s) : 数理与信息工程学院

Document Type : 期刊

Volume : Vol.119

Page Number : 9-13

ISSN : 0020-0190

Key Words : Approximation;algorithms;k-path;vertex;cover;Ball;graph;PTAS

Abstract : A vertex set F is a k -path vertex cover (VCP k  ) of graph G if every path of G on k vertices contains at least one vertex from F. A graph G is a d-dimensional ball graph if each vertex of G corresponds to a ball in R d  , two vertices are adjacent in G

Translation or Not : no