3415 search results - page 526 / 683 » Lower Bounds for Kernelizations |
132
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
145
click to vote
MOBICOM
2009
ACM
15 years 11 months ago
2009
ACM
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
167
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
134
click to vote
CDC
2008
IEEE
15 years 11 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...
136
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...