1279 search results - page 47 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
132
click to vote
WADS
2005
Springer
15 years 10 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 ...
131
click to vote
SIROCCO
2004
15 years 5 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...
153
click to vote
SIAMSC
2008
15 years 4 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...
121
click to vote
SIGECOM
2006
ACM
15 years 10 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...
140
click to vote
ESA
1998
Springer
15 years 8 months 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 ...