370 search results - page 33 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
112
click to vote
CCCG
2008
15 years 3 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
121
click to vote
PPAM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
117
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
120
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
116
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...