Sciweavers

374 search results - page 26 / 75
» Lower-bounded facility location
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 18 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
MSN
2007
Springer
110views Sensor Networks» more  MSN 2007»
14 years 4 months ago
A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...
Xinxin Liu, Xiaohua Jia, Hai Liu, Li Feng
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 4 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
RECOMB
2006
Springer
14 years 10 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
PPSN
1998
Springer
14 years 2 months ago
Integrated Facility Design Using an Evolutionary Approach with a Subordinate Network Algorithm
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...
Bryan A. Norman, Alice E. Smith, Rifat Aykut Arapo...