7129 search results - page 331 / 1426 » Approximation Algorithms for Treewidth |
158
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
139
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
146
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
126
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
108
click to vote
FOCM
2007
15 years 4 months ago
2007
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...