The Tourism-Development Nexus in Namibia : A Study on National Tourism Policy and Local Tourism Enterprises' Policy Knowledge

The tourism development nexus in southern Africa involves highly topical issues related to tourism planning, power relations, community participation, and natural resources. Namibia offers a particularly interesting context for the study of these issues due to its colonial legacy, vast tourism potential, recently adopted tourism policy and community-based approaches to tourism and natural resource management. This study is an interdisciplinary endeavour to analyse the role of tourism in Namibia s post-apartheid transformation process by focusing on Namibian tourism policy and local tourism enterprises' policy knowledge. Major attention is paid to how the tourism policy's national development objectives are understood and conceptualised by the representatives of different tourism enterprises and the ways in which they relate to the practical needs of the enterprises. Through such local policy knowledge the study explores various opportunities, challenges and constraints related to the promotion of tourism as a development strategy. The study utilises a political economy approach to tourism and development through three current and interrelated discourses which are relevant in the Namibian context. These are tourism, power and inequality, tourism and sustainable development, and tourism and poverty reduction. The qualitative research material was gathered in Namibia in 2006-2007 and 2008. This material consists of 34 semi-structured interviews in 16 tourism enterprises, including private trophy hunting farms and private lodges, small tour operators and community-based tourism enterprises. In addition, the research material consists of observations in the enterprises, and 37 informal and 23 expert interviews. The findings indicate that in the light of local tourism enterprises the tourism policy objectives appear more complex and ambiguous. Furthermore, they involve multiple meanings and interpretations which reflect the socio-economic stratification of the informants and Namibian society, together with the professional stratification of the tourism enterprises and restrictions on the capacity of tourism to address the development objectives. In the light of such findings it is obvious that aspects of power and inequality affect the tourism development nexus in Namibia. The study concludes that, as in the case of other southern African countries, in order to promote sustainable development and reduce poverty, Namibia should not only target tourism growth but pay attention to who benefits from that growth and how. From a political economy point of view, it is important that prevailing structural challenges are addressed equally in the planning of tourism, development and natural resource management. Such approach would help the Namibian majority to enjoy the benefits of increasing tourism in the country.

Whose ETSIP? National and local ownership of Namibia's education and training sector improvement programme

Tämä työ tarkastelee kansallista ja paikallista omistajuutta Namibian opetussektorin kehittämisohjelmassa. Opetussektorin kehittämisohjelma ETSIP on 15-vuotinen sektoriohjelma vuosille 2005-2015 ja sen tavoitteena on edesauttaa Namibian kehittymistä tietoyhteiskunnaksi. Tutkimuksen tarkoituksena on selvittää miten kansallinen ja paikallinen omistajuus on toteutunut ETSIP prosessin aikana. Erityisesti pyritään selvittämään paikallistason opetussektorin virkamiesten näkemyksiä ETSIP prosessista, heidän roolistaan siinä ja siitä millaisia vaikuttamisen ja hallinnan mahdollisuuksia heillä on ollut prosessin aikana. Tutkimuksen lähtökohta on laadullinen ja lähestymistapa konstruktionistinen: tutkimus tarkastelee todellisuutta ihmisten kokemusten, näkemysten ja toiminnan kautta. Tutkimusaineisto koostuu haastatteluista, epävirallisista keskusteluista, lehtiartikkeleista ja ETSIP dokumenteista. Tutkimus osoittaa että kansallinen omistajuus on epämääräinen käsite sillä kansallisia toimijoita ja näkemyksiä on useita. Tutkimus vahvistaa Castel-Brancon huomion siitä, että omistajuutta on tarkasteltava kontekstissaan: muuttuvana ja kilpailtuna. ETSIPin rinnalle ollaan valmistelemassa uutta strategista ohjelmaa opetusministeriölle mikä saattaa muuttaa omistajuutta ETSIPiin. ETSIP dokumenttien omistajuusretoriikka myötäilee kansainvälisiä sitoumuksia avun vaikuttavuuden parantamiseksi mutta niistä puuttuu syvällisempi analyysi siitä, miten kansallinen ja paikallinen omistajuus toteutuisi käytännössä. Avunantajien näkemys omistajuudesta on suppea: omistajuus nähdään lähinnä sitoutumisena ennalta määrättyyn politiikkaohjelmaan. Haastatteluaineistosta nousee esiin Whitfieldin ja Frazerin jaottelu suppeista ja laajoista omistajuuskäsityksistä. Sitoutumista ETSIP ohjelmaan pidetään tärkeänä mutta riittämättömänä määritteenä omistajuudelle. Paikallisella tasolla sitoutuminen ETSIP ohjelman periaatteisiin ja tavoitteisiin on toteutunut melko hyvin mutta jos omistajuutta tarkastellaan laajemmin vaikutusvallan ja hallinnan käsitteiden kautta voidaan todeta että omistajuus on ollut heikkoa. Paikallisella tasolla ei ole ollut juurikaan vaikutusvaltaa ETSIP ohjelman sisältöön eikä mahdollisuutta hallita ohjelman toteutusta ja päättää siitä mitä hankkeita ohjelman kautta rahoitetaan. Tujanin demokraattisen omistajuuden käsite kuvaa tarvetta muuttaa ja laajentaa omistajuusajattelua huomioiden paikallisen tason paremmin. Tämä tutkimus viittaa siihen että omistajuuden toteutuminen paikallisella tasolla edellyttäisi institutionaalisen kulttuurin muutosta ja institutionaalisen legitimiteetin vahvistamista. Omistajuuden mahdollistamiseksi paikallisella tasolla tarvittaisiin poliittista johtajuutta, luottamusta, vastuullisuuden kulttuurin kehittämistä, tehokkaampaa tiedonjakoa, laajaa osallistumista, vuoropuhelua ja yhteistyötä. Ennen kaikkea tarvittaisiin paikallisen tason vaikutusvaltaa päätöksenteossa ja kontrollia resurssien käytöstä. Tälle muutokselle on selvä tarve ja tilaus.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

Global, Local and Vector-Valued Tb Theorems on Non-Homogeneous Metric Spaces

Various Tb theorems play a key role in the modern harmonic analysis. They provide characterizations for the boundedness of Calderón-Zygmund type singular integral operators. The general philosophy is that to conclude the boundedness of an operator T on some function space, one needs only to test it on some suitable function b. The main object of this dissertation is to prove very general Tb theorems. The dissertation consists of four research articles and an introductory part. The framework is general with respect to the domain (a metric space), the measure (an upper doubling measure) and the range (a UMD Banach space). Moreover, the used testing conditions are weak. In the first article a (global) Tb theorem on non-homogeneous metric spaces is proved. One of the main technical components is the construction of a randomization procedure for the metric dyadic cubes. The difficulty lies in the fact that metric spaces do not, in general, have a translation group. Also, the measures considered are more general than in the existing literature. This generality is genuinely important for some applications, including the result of Volberg and Wick concerning the characterization of measures for which the analytic Besov-Sobolev space embeds continuously into the space of square integrable functions. In the second article a vector-valued extension of the main result of the first article is considered. This theorem is a new contribution to the vector-valued literature, since previously such general domains and measures were not allowed. The third article deals with local Tb theorems both in the homogeneous and non-homogeneous situations. A modified version of the general non-homogeneous proof technique of Nazarov, Treil and Volberg is extended to cover the case of upper doubling measures. This technique is also used in the homogeneous setting to prove local Tb theorems with weak testing conditions introduced by Auscher, Hofmann, Muscalu, Tao and Thiele. This gives a completely new and direct proof of such results utilizing the full force of non-homogeneous analysis. The final article has to do with sharp weighted theory for maximal truncations of Calderón-Zygmund operators. This includes a reduction to certain Sawyer-type testing conditions, which are in the spirit of Tb theorems and thus of the dissertation. The article extends the sharp bounds previously known only for untruncated operators, and also proves sharp weak type results, which are new even for untruncated operators. New techniques are introduced to overcome the difficulties introduced by the non-linearity of maximal truncations.