982 search results - page 134 / 197 » Solving Steiner tree problems in graphs to optimality |
95
Voted
ICFP
2003
ACM
16 years 16 days ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
128
Voted
SIGMOD
2011
ACM
14 years 3 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
139
click to vote
MOBICOM
2006
ACM
15 years 6 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...
81
Voted
TCS
2008
15 years 14 days ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...