986 search results - page 157 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...