Sciweavers

895 search results - page 7 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
GEM
2010
13 years 5 months ago
Revisiting Genetic Algorithms for the FPGA Placement Problem
In this work, we present a genetic algorithm framework for the FPGA placement problem. This framework is constructed based on previous proposals in this domain. We implement this f...
Peter Jamieson
JCO
2002
48views more  JCO 2002»
13 years 7 months ago
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
M. Ericsson, Mauricio G. C. Resende, Panos M. Pard...
FCT
2007
Springer
14 years 1 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 6 days ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan