402 search results - page 42 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...