Results 1  10
of
320,542
The Online Median Problem
 In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science
, 2000
"... We introduce a natural variant of the (metric uncapacitated) kmedian problem that we call the online median problem. Whereas the kmedian problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities ar ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
We introduce a natural variant of the (metric uncapacitated) kmedian problem that we call the online median problem. Whereas the kmedian problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities
Approximation algorithms for metric facility location and kmedian problems using the . . .
"... ..."
KMedian Problem on Graph
"... In past decades there has been a tremendous growth in the literature on location problems. However, among the myriad of formulations provided, the simple plant location problem and the kmedian problem have played a centra l role. This phenomenon is due to the fact that both problems have a wide ran ..."
Abstract
 Add to MetaCart
In past decades there has been a tremendous growth in the literature on location problems. However, among the myriad of formulations provided, the simple plant location problem and the kmedian problem have played a centra l role. This phenomenon is due to the fact that both problems have a wide
The Online Median Problem \Lambda
, 1999
"... Abstract We introduce a natural variant of the (metric uncapacitated) kmedian problem that we call the online median problem. Whereas the kmedian problem involves optimizing the simultaneous placementof k facilities, the online median problem imposes the following additional constraints: the faci ..."
Abstract
 Add to MetaCart
Abstract We introduce a natural variant of the (metric uncapacitated) kmedian problem that we call the online median problem. Whereas the kmedian problem involves optimizing the simultaneous placementof k facilities, the online median problem imposes the following additional constraints
The Reversal Median Problem
 INFORMS Journal on Computing
, 2003
"... In this paper, we study the Reversal Median Problem (RMP), which arises in computational biology and is a basic model for the reconstruction of evolutionary trees. Given q genomes, RMP calls for another genome such that the sum of the reversal distances between this genome and the given ones is mini ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
In this paper, we study the Reversal Median Problem (RMP), which arises in computational biology and is a basic model for the reconstruction of evolutionary trees. Given q genomes, RMP calls for another genome such that the sum of the reversal distances between this genome and the given ones
The Matroid Median Problem
"... In the classical kmedian problem, we are given a metric space and would like to openk centers so as to minimize the sum (over all the vertices) of the distance of each vertex to its nearest open center. In this paper, we consider the following generalization of the problem: instead of opening at mo ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
In the classical kmedian problem, we are given a metric space and would like to openk centers so as to minimize the sum (over all the vertices) of the distance of each vertex to its nearest open center. In this paper, we consider the following generalization of the problem: instead of opening
Center Problems and Median Problems
"... Introduction In this chapter, we would like to find optimal (or approximately optimal) locations for routine services, such as airports, factories, warehouses, schools, garbage incinerators, prisons, etc., as well as for emergency services such as ambulances, fire stations and snow plows. Locationa ..."
Abstract
 Add to MetaCart
. We focus on three types of problems: 1. Center problems (also called minimax problems): 106 8.2. THE BASIC MODEL FOR MEDIAN PROBLEMS AND CENTER PROBLEMS 107 A given number of facilities (or services) must be located so as to minimize the maximum travel cost (or maximum travel time) of the users to
On the Matrix Median Problem
"... Abstract. The Genome Median Problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. Recently, Feij ..."
Abstract
 Add to MetaCart
Abstract. The Genome Median Problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. Recently
Approximation Algorithms for Geometric Median Problems
, 1992
"... In this paper we present approximation algorithms for median problems in metric spaces and fixeddimensional Euclidean space. Our algorithms use a new method for transforming an optimal solution of the linear program relaxation of the smedian problem into a provably good integral solution. This ..."
Abstract

Cited by 80 (0 self)
 Add to MetaCart
In this paper we present approximation algorithms for median problems in metric spaces and fixeddimensional Euclidean space. Our algorithms use a new method for transforming an optimal solution of the linear program relaxation of the smedian problem into a provably good integral solution
Results 1  10
of
320,542