A polynomial-time approximation scheme for the airplane refueling problem
نویسندگان
چکیده
منابع مشابه
A Polynomial-Time Approximation Scheme for The Airplane Refueling Problem
We study the airplane refueling problem which was introduced by the physicists Gamow and Stern in their classical book Puzzle-Math (1958). Sticking to the original story behind this problem, suppose we have to deliver a bomb in some distant point of the globe, the distance being much greater than the range of any individual airplane at our disposal. Therefore, the only feasible option to carry ...
متن کاملA polynomial time approximation scheme for the MRCT problem∗
The ratio achieves its minimum when the two terms coincide, i.e., δ = 1/4, and the minimum ratio is 4/3. In fact, by using a general star and a (1/4)-separator, it is possible to approximate an MRCT with ratio (4/3) + ε for any constant ε > 0 in polynomial time. The additional error ε is due to the difference between the guessed and the true separators. By this strategy, the approximation ratio...
متن کاملA Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of n items and m bins (knapsacks) such that each item i has a profit p(i) and a size s(i), and each bin j has a capacity c(j). The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is...
متن کاملPolynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
Abst ract Given a set N of n terminals in the rst quadrant of the Euclidean plane E 2 , nd a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horiz on tal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem. which has been proved to be NP-complete recentl...
متن کاملPolynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2018
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-018-0569-x