743 search results - page 126 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
FOCS
1997
IEEE
14 years 8 days ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
DATAMINE
2010
13 years 8 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...