Sign in
A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph.
Zhao Zhang
Xiaohui Huang
Lina Chen
Published in:
WASA (2017)
Keyphrases
</>
dynamic programming
probabilistic model
maximum likelihood
computational complexity
random walk
connected components
log likelihood
vertex cover