9 search results - page 2 / 2 » Cycles of even lengths modulo k |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
TPDS
2008
13 years 5 months ago
2008
Let k 4 be even and let n 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv +fe 2n-2. We prove that ...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
DASFAA
2003
IEEE
13 years 10 months ago
2003
IEEE
With the wide availability of content delivery networks, many e-commerce Web applications utilize edge cache servers to cache and deliver dynamic contents at locations much closer...