909 search results - page 23 / 182 » On the approximability of some network design problems |
113
click to vote
WICON
2008
15 years 2 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
116
click to vote
MP
1998
15 years 1 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
122
click to vote
ATAL
2008
Springer
2008
Springer
Efficient approximate inference in distributed Bayesian networks for MAS-based sensor interpretation
15 years 3 months ago
The multiply sectioned Bayesian network (MSBN) framework is the most studied approach for distributed Bayesian Network inference in an MAS setting. This paper describes a new fram...
118
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
148
click to vote
MST
2010
14 years 8 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...