3415 search results - page 103 / 683 » Lower Bounds for Kernelizations |
108
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
111
Voted
CIE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
120
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
85
Voted
ECCC
2011
14 years 7 months ago
2011
90
Voted
EJC
2011
14 years 7 months ago
2011