545 search results - page 34 / 109 » Simultaneous approximation by greedy algorithms |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
COMGEO
2006
ACM
13 years 8 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
WABI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Applied Biosystems’ SOLiD system offers a low-cost alternative to the traditional Sanger method of DNA sequencing. We introduce two main algorithms of mapping SOLiD’...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— When a sensor network is deployed in the field, it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes tha...