An Approximation Algorithm for the 2-Dispersion Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn approximation algorithm for the Bandpass-2 problem
The general Bandpass-B problem is NP-hard and can be approximated by a reduction into the weighted B-set packing problem, with a worst case performance ratio of O(B). When B = 2, a maximum weight matching gives a 2-approximation to the problem. In this paper, we call the Bandpass-2 problem simply the Bandpass problem. The Bandpass problem can be viewed as a variation of the maximum traveling sa...
متن کاملA Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly intersecting unit disks whose centers are in P . The task is to find a set B of m disks of maximum radius such that no disk in B intersects a disk in B ∪ R, where m is the maximum number of unit disks that can be packed. B...
متن کاملAn Approximation Algorithm For Point Guard Problem
In 1973, Victor Klee posed the following question: How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This resulted in many subsequent researches so that the various versions of the art gallery problem were posed. Most of the versions posed are NP-hard, so designing approximation algorithms becomes important. The b...
متن کاملAn Approximation Algorithm for Alphabet Indexing Problem
Alphabet Indexing is the problem to nd a mapping f : ! f1; : : : ;Kg for alphabet , positive integer K and a pair of disjoint sets of strings P;Q such that f transforms no two strings from P and Q into identical ones. Although Alphabet Indexing problem is NP-complete, we de ne a combinatorial optimization problem, Max K-Indexing, and propose a simple greedy algorithm for this problem. Then we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2020
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2019fcp0005