402 search results - page 10 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
WADS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
IPCO
2010
13 years 8 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...