<s>
In	O
the	O
parameterized	B-General_Concept
complexity	I-General_Concept
of	O
algorithms	O
,	O
the	O
klam	B-General_Concept
value	I-General_Concept
of	O
a	O
parameterized	B-General_Concept
algorithm	O
is	O
a	O
number	O
that	O
bounds	O
the	O
parameter	O
values	O
for	O
which	O
the	O
algorithm	O
might	O
reasonably	O
be	O
expected	O
to	O
be	O
practical	O
.	O
</s>
<s>
An	O
algorithm	O
with	O
a	O
higher	O
klam	B-General_Concept
value	I-General_Concept
can	O
be	O
used	O
for	O
a	O
wider	O
range	O
of	O
parameter	O
values	O
than	O
another	O
algorithm	O
with	O
a	O
lower	O
klam	B-General_Concept
value	I-General_Concept
.	O
</s>
<s>
The	O
klam	B-General_Concept
value	I-General_Concept
was	O
first	O
defined	O
by	O
,	O
and	O
has	O
since	O
been	O
used	O
by	O
other	O
researchers	O
in	O
parameterized	B-General_Concept
complexity	I-General_Concept
both	O
as	O
a	O
way	O
of	O
comparing	O
different	O
algorithms	O
to	O
each	O
other	O
and	O
in	O
order	O
to	O
set	O
goals	O
for	O
future	O
algorithmic	O
improvements	O
.	O
</s>
<s>
To	O
prevent	O
artificially	O
improving	O
the	O
klam	B-General_Concept
value	I-General_Concept
of	O
an	O
algorithm	O
by	O
putting	O
more	O
of	O
its	O
complexity	O
into	O
the	O
part	O
of	O
the	O
time	O
bound	O
,	O
also	O
limit	O
to	O
be	O
at	O
most	O
three	O
,	O
valid	O
for	O
many	O
known	O
fixed-parameter	O
tractable	O
algorithms	O
.	O
</s>
<s>
At	O
that	O
time	O
the	O
best	O
known	O
parameterized	B-General_Concept
time	O
bound	O
had	O
.	O
</s>
<s>
Solving	O
gives	O
a	O
klam	B-General_Concept
value	I-General_Concept
of	O
approximately	O
129	O
.	O
</s>
<s>
For	O
a	O
simple	O
exponential	O
bound	O
such	O
as	O
this	O
one	O
,	O
one	O
can	O
solve	O
directly	O
from	O
which	O
Niedermeier	O
derives	O
a	O
klam	B-General_Concept
value	I-General_Concept
of	O
approximately	O
165	O
.	O
</s>
<s>
Subsequent	O
research	O
has	O
developed	O
parameterized	B-General_Concept
vertex	O
cover	O
algorithms	O
with	O
giving	O
a	O
klam	B-General_Concept
value	I-General_Concept
of	O
approximately	O
190	O
.	O
</s>
<s>
Another	O
example	O
of	O
a	O
problem	O
in	O
which	O
the	O
klam	B-General_Concept
value	I-General_Concept
has	O
been	O
explicitly	O
used	O
as	O
a	O
goal	O
for	O
future	O
research	O
is	O
the	O
maximum	O
leaf	O
spanning	O
tree	O
problem	O
,	O
in	O
which	O
the	O
goal	O
is	O
to	O
find	O
a	O
spanning	O
tree	O
of	O
a	O
graph	O
with	O
as	O
many	O
leaf	O
nodes	O
as	O
possible	O
(	O
parameterized	B-General_Concept
by	O
the	O
number	O
of	O
leaves	O
)	O
.	O
</s>
<s>
develop	O
an	O
algorithm	O
for	O
this	O
problem	O
which	O
they	O
compare	O
using	O
the	O
klam	B-General_Concept
value	I-General_Concept
to	O
previous	O
work	O
on	O
the	O
same	O
problem	O
:	O
previous	O
algorithms	O
had	O
klam	B-General_Concept
values	I-General_Concept
of	O
1	O
and	O
5	O
,	O
and	O
theirs	O
has	O
a	O
klam	B-General_Concept
value	I-General_Concept
of	O
16	O
.	O
</s>
<s>
However	O
,	O
they	O
also	O
suggest	O
that	O
it	O
should	O
be	O
possible	O
to	O
provide	O
improved	O
algorithms	O
for	O
this	O
problem	O
with	O
a	O
klam	B-General_Concept
value	I-General_Concept
of	O
at	O
least	O
50	O
.	O
</s>
<s>
Although	O
this	O
remains	O
open	O
,	O
several	O
later	O
papers	O
have	O
incrementally	O
improved	O
the	O
klam	B-General_Concept
value	I-General_Concept
of	O
this	O
problem	O
to	O
37	O
.	O
</s>
