105 search results - page 16 / 21 » A Lower Bound on the Competitive Ratio of Truthful Auctions |
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
SODA
1996
ACM
13 years 10 months ago
1996
ACM
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
ALGORITHMICA
2010
13 years 9 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...