599 search results - page 86 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
RTCSA
2000
IEEE
14 years 3 days ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
INFORMS
2008
13 years 7 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...