3415 search results - page 47 / 683 » Lower Bounds for Kernelizations |
JOC
2008
13 years 11 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
ENDM
2010
13 years 5 months ago
2010
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
NETWORKS
2008
13 years 11 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
APPROX
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...