35 search results - page 7 / 7 » On shortest paths in line arrangements |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
INFOCOM
2009
IEEE
14 years 10 hour ago
2009
IEEE
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...