Sciweavers

107 search results - page 21 / 22
» Tight Results on Minimum Entropy Set Cover
Sort
View
TAMC
2007
Springer
14 years 10 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
IWPEC
2009
Springer
14 years 23 days ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
JGT
2010
158views more  JGT 2010»
13 years 4 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 25 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
BMCBI
2007
101views more  BMCBI 2007»
13 years 6 months ago
Robust detection and verification of linear relationships to generate metabolic networks using estimates of technical errors
Background: The size and magnitude of the metabolome, the ratio between individual metabolites and the response of metabolic networks is controlled by multiple cellular factors. A...
Frank Kose, Jan Budczies, Matthias Holschneider, O...