Filetype
In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighborhoods, with totally n ver-tices, and we seek the shortest tour that visits each neighborhood. TheEuclidean TSP is a special case of the TSPN problem, so TSPN is alsoNP-hard. In this paper we present a simple and fast algorithm that, givena start point, computes a TSPN tour of length O(log k) times
Abstract is not available
This research is an attempt to conceptualize the underlying forces behind persistent and ubiquitous problems of inequality in access to water in cities of the global south. Inequality in water access is hypothesized to result from urban water regimes that tend to prioritize the right to water access or to provide preferential terms of access for some groups in society, while marginalizing others.
Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. In Paper A, the error correcting capability of tailbiting codes is described via the active distances for
“Diversify or die” is a recurring and rather dramatic call for organizations to recruit, retain and manage a demographically diverse workforce, advocated by the business case for diversity, also known as diversity management philosophy. Diversity management places diverse social identities at the heart of organizational success and has gained much attention from management consultants and managers
Spatially coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform close to the Shannon limit. In this paper we investigate the suitability of coupled regular LDPC code ensembles with respect to rate-flexibility. Regular ensembles with good performance and low complexity exist for a variety of specific code rates. On the other hand it can be
