397 search results - page 44 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...
120
click to vote
PODS
2001
ACM
15 years 12 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
103
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...