The subdivision-constrained minimum spanning tree problem
نویسندگان
چکیده
منابع مشابه
The subdivision-constrained minimum spanning tree problem
Motivated by the constrained minimum spanning tree (CST) problem in Hassin and Levin [R. Hassin, A. Levin, An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection, SIAM Journal on Computing 33 (2) (2004) 261–268], we study a new combinatorial optimization problem in this paper, called the general subdivision-constrained span...
متن کاملThe delay-constrained minimum spanning tree problem
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim’s algorithm for the unconstrained minimum spanning ...
متن کاملWeight-Constrained Minimum Spanning Tree Problem
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to find a spanning tree of total edge weight at most a given value W and minimum total costs under this restriction. In this thesis a literature overview on this NP-hard problem, theoretical properties concerning the convex hull and the Lagrangian relaxation are given. W...
متن کاملConstraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Given an undirected connected graph G = (V,E) with a set V of vertices, a set E of edges, and costs cij associated to every edge [i, j] ∈ E, with i < j, the Diameter Minimum Spanning Tree Problem (DCMST) consists in finding a minimum spanning tree T = (V,E ), with E ′ ⊆ E, where the diameter required does not exceed a given positive integer value D, where 2 ≤ D ≤ |V | − 1. The diameter of a tre...
متن کاملCross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident. One of the critical issues in the network design process is the topological design problem involved in establishing a centralized data communication network with best performance and low costs. It can be recognized as a degree-constrained minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.038