721 search results - page 123 / 145 » Bounds on the k-domination number of a graph |
129
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
86
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
103
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
85
Voted
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...