Sciweavers

3656 search results - page 51 / 732
» Compact Location Problems
Sort
View
IPCO
2010
210views Optimization» more  IPCO 2010»
13 years 8 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
TALG
2010
109views more  TALG 2010»
13 years 8 months ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos
JMIV
2007
143views more  JMIV 2007»
13 years 9 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
WMCSA
1999
IEEE
14 years 2 months ago
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, c...
Young-Bae Ko, Nitin H. Vaidya
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
14 years 1 months ago
Crossover gene selection by spatial location
Spatial based gene selection for division of chromosomes used by crossover operators is proposed for three-dimensional problems. This spatial selection is shown to preserve more g...
David M. Cherba, William F. Punch