Authors: Zhao Zhang Weili Wu Lidan Fan DingZhu Du
Publish Date: 2013/10/13
Volume: 59, Issue: 2-3, Pages: 663-671
Abstract
Using local search method this paper provides a polynomial time approximation scheme for the minimum vertex cover problem on ddimensional ball graphs where d ge 3 The key to the proof is a new separator theorem for ball graphs in higher dimensional space
Keywords: