Improving shortest paths in the Delaunay triangulation

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s; t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to t in the Delaunay triangulation of P u{p} improves as much as possible. We study properties of the problem and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

CSR Policies: Effects on Labour Productivity in Spanish Micro and Small Manufacturing Companies

This paper analyses empirical evidence of efforts to enable Spanish micro and small manufacturing companies to boost their labour productivity rates through the development of the main pillars of their corporate social responsibility (CSR) policies. This study aims to develop new approaches and sensibilities towards work from an ethical, values (virtues) and CSR perspective, showing how internal dimensions of CSR, such those related to relationships with employees and responsibility in processes and product quality, can improve labour performance and labour efficiency, thereby contributing to a better society. The results of a sample of 929 small businesses indicate that the social responsibility policies that most contributed to a short-term increase in labour productivity are those related to internal aspects of the company, in particular its involvement in the quality of processes and products, promotion of innovation and employee care. However, the impact on labour productivity of CSR policies related to external factors, such as relationship with stakeholders and environmental concern, could not be empirically proven in this paper.

Quantifying dispersal paths in probabilistic habitat networks: a reply to hock and mumby (2015) and an overview of recent developments and applications

Hock and Mumby (2015) describe an approach to quantify dispersal probabilities along paths in networks of habitat patches. This approach basically consists in determining the most probable (most reliable) path for movement between habitat patches by calculating the product of the dispersal probabilities in each link (step) along the paths in the network. Although the paper by Hock and Mumby (2015) has value and includes interesting analyses (see comments in section 7 below), the approach they describe is not new.