12519 search results - page 188 / 2504 » Approximation Problems Categories |
162
click to vote
AAIM
2008
Springer
16 years 25 days ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
211
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
155
click to vote
TSMC
2002
15 years 6 months ago
2002
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
152
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
151
click to vote
ESA
2010
Springer
15 years 7 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...