4103 search results - page 16 / 821 » Some results on the Collatz problem |
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
90
Voted
ALGORITHMICA
2010
14 years 12 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
CATS
2007
15 years 1 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
APPML
2008
14 years 12 months ago
2008
The asymptotic behaviour of the smallest eigenvalue in linear Koiter shell problems is studied, as the thickness parameter tends to zero. In particular, three types of shells of r...
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...