Sciweavers

212 search results - page 23 / 43
» Competitive Online Approximation of the Optimal Search Ratio
Sort
View
CCCG
2010
13 years 9 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
LATIN
2004
Springer
14 years 1 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
CEC
2007
IEEE
14 years 2 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
IPCO
2010
210views Optimization» more  IPCO 2010»
13 years 6 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...
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
14 years 1 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...