2489 search results - page 208 / 498 » On the Subgroup Distance Problem |
135
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
140
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
112
click to vote
EOR
2007
15 years 4 months ago
2007
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
144
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
150
click to vote
DDECS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...