منابع مشابه
On the Euclidean Minimum Spanning Tree Problem∗
Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning...
متن کاملThe Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کاملThe Euclidean k-Supplier Problem
In the k-supplier problem, we are given a set of clients C and set of facilities F located in a metric (C∪F, d), along with a bound k. The goal is to open a subset of k facilities so as to minimize the maximum distance of a client to an open facility, i.e., minS⊆F :|S|=k maxv∈C d(v, S), where d(v, S) = minu∈S d(v, u) is the minimum distance of client v to any facility in S. We present a 1 + √ 3...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملOn the Bicriterion Multi Modal Assignment Problem
We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximation. Extensive computational results are conducted on a large library of test instances to test the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1988
ISSN: 0377-0427
DOI: 10.1016/0377-0427(88)90001-5