986 search results - page 83 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
133
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
110
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
132
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
148
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
157
click to vote
DC
2010
15 years 3 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...