Sciweavers

3192 search results - page 131 / 639
» The minimum latency problem
Sort
View
121
Voted
DM
2010
82views more  DM 2010»
15 years 3 months ago
The complexity of the weight problem for permutation and matrix groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
Peter J. Cameron, Taoyang Wu
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 3 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
15 years 10 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
UC
2005
Springer
15 years 9 months ago
On Formulations of Firing Squad Synchronization Problems
Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used i...
Kojiro Kobayashi, Darin Goldstein
GECCO
2004
Springer
15 years 9 months ago
Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
Mohammad Amin Dallaali, Malin Premaratne