284 search results - page 16 / 57 » Linear Time Algorithms for Generalized Edge Dominating Set P... |
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
DIS
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...