The Minimum Cost Connected Subgraph for the Vascular Network
نویسندگان
چکیده
منابع مشابه
The Minimum Cost Connected Subgraph Problem in Medical Image Analysis
Several important tasks in medical image analysis can be stated in the form of an optimization problem whose feasible solutions are connected subgraphs. Examples include the reconstruction of neural or vascular structures under connectedness constraints. We discuss the minimum cost connected subgraph (MCCS) problem and its approximations from the perspective of medical applications. We propose ...
متن کاملOn the minimum-cost λ-edge-connected k-subgraph problem
In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ -edge-connected k-subgraph problem, or the (k,λ )-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ = 1), λ -edgeconnected spanning subgraph problem (if k = |V |) and k-clique problem (if λ = k−1 and...
متن کاملAn Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
We present an approximation algorithm for the problem of finding a minimum-cost k-vertex connected spanning subgraph, assuming that the number of vertices is at least 6k. The approximation guarantee is six times the kth harmonic number (which is O(log k)), and this is also an upper bound on the integrality ratio for a standard linear programming relaxation.
متن کاملToward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem
Given a complete graph Kn = (V,E) with non-negative edge costs c ∈ RE , the problem 2EC is that of finding a 2-edge connected spanning multi-subgraph of Kn of minimum cost. The integrality gap α2EC of the linear programming relaxation 2EC for 2EC has been conjectured to be 65 , although currently we only know that 65 ≤ α2EC ≤ 3 2 . In this paper, we explore the idea of using the structure of so...
متن کاملA PTAS for the Minimum Cost 2-edge-Connected Spanning Subgraph in Planar Graphs
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanning subgraph of minimum cost. We present a polynomial time approximation scheme (PTAS) for this problem when the costs are uniform, or when the total cost of G is within a constant factor of the optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2019
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2018.11.172