1279 search results - page 55 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
231
Voted
DAC
2011
ACM
14 years 2 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
115
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
142
Voted
WDAG
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
119
click to vote
WASA
2009
Springer
15 years 9 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
119
click to vote
AAAI
2007
15 years 4 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...