The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if <InlineEquation ID="IEq1"> <EquationSource...</equationsource></inlineequation>

In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k ≥ 2, and are required to find a subset C of vertices with minimum cardinality such that each path with length k − 1 has a vertex in C, and moreover, the induced subgraph G[C]...

This paper empirically examines the international spillover of economic growth through bilateral trade. We extend the Solow growth model with a spatial autoregressive term and a spatial time lag term, and estimate such a model with a sample of 26 OECD countries over the period 1971–2005. We...

This paper investigates the quasi-maximum likelihood (QML) estimation of spatial panel data models where spatial weights matrices can be time varying. We show that QML estimate is consistent and asymptotically normal. We also derive the asymptotic distribution of average impact coefficients...