598 search results - page 37 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
DIS
2007
Springer
14 years 2 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
IPL
2010
13 years 7 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
ICPP
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...