7930 search results - page 163 / 1586 » Greedy in Approximation Algorithms |
150
click to vote
WINE
2007
Springer
16 years 15 days ago
2007
Springer
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
133
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
169
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
134
click to vote
TCBB
2008
15 years 6 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
136
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...