1279 search results - page 28 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
141
click to vote
TMC
2010
15 years 10 hour ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
115
click to vote
RSS
2007
15 years 3 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
137
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
120
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
130
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...