1279 search results - page 47 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
WADS
2005
Springer
14 years 2 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
SIROCCO
2004
13 years 10 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
SIAMSC
2008
13 years 8 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
ESA
1998
Springer
14 years 29 days ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...