In this note we showed that a p(≥ 2)-center location problem in general networks can be transformed to the well known Klee’s measure problem [3]. This resulted in an improved algorithm for the continuous case with running time O(mn2 ∗ n log n). The previous best result for the problem is O(mnα(n) log n) where α(n) is the inverse Ackermann function [9]. When the underlying network is a partial k...

Original scientific paper Location problems consider locating facilities with the objective of finding their best locations. In most real world problems, it is common that a demand node is required to be covered with multiple facilities in order to ensure a backup supply. The backup supply is necessary especially for public or emergency service location problems where a covered demand may not b...

In this paper, we will describe some algorithms and give their complexity as following: (1) The algorithm for finding a dominating set of radius r in a vertex-weighted graph with small number of spanning tress. The complexity of this algorithm for the unicyclic graph is O(m.n). (2) The algorithm for finding an absolute and vertex p-center of a vertex-weighted graph with small number of spanning...

We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Cent...

The use of digital images has becoming increasingly popular, mainly due to the drop in media equipament's prices, such as, cameras, scanners, video cameras, computers, among others. However, even for the current storage patterns [3,4,5], the digital images consume a large quantity of the resources. In this context, this paper presents a single and intuitive manner to reduce the size of digital ...