Polynomial-Time Approximation Schemes
نویسندگان
چکیده
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, and Mathieu (2007) from planar graphs to bounded-genus graphs: any future problems shown to admit the required structure theorem for planar graphs will similarly extend to bounded-genus graphs.
منابع مشابه
On efficient polynomial-time approximation schemes for problems on planar structures
This work examines the existence of efficient polynomial-time approximation schemes (EPTAS) for a variety of problems contained in the syntactic classes Planar TMIN, Planar TMAX, and Planar MPSAT as defined by Khanna and Motwani. Based on the recent work of Alber, Bodlaender, Fernau and Niedermeier and others, we describe subclasses of problems from Planar TMIN, Planar TMAX, and Planar MPSAT th...
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملFast fully polynomial approximation schemes for minimizing completion time variance
We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n/ ) and thus improves on all fully polynomial approximation schemes presented in the literature.
متن کاملFully Polynomial Time Approximation Schemes for Sequential Decision Problems
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many previous results in the literature follow as direct corollaries...
متن کاملBiorthogonal wavelet-based full-approximation schemes for the numerical solution of elasto-hydrodynamic lubrication problems
Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.
متن کاملApproximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomial-time approximation schemes) as well as obtain inapproximability results. In particular, we show that a large subclass of scoring protocols admits fully polynomial-time approximation schemes for the coalitional weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013