402 search results - page 56 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
NETWORKING
2007
13 years 8 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
ICCSA
2004
Springer
14 years 22 days ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...