Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
Approximation Schemes for Planar Graph Problems
Many NP-hard graph problems become easier to approximate on planar graphs and their generalizations. (A graph is planar if it can be drawn in the plane (or the sphere) without crossings. For definitions of other related graph classes, see the entry on Bidimensionality (2004; Demaine, Fomin, Hajiaghayi, Thilikos).) For example, maximum independent set asks to find a maximum subset of vertices in...
متن کاملTHREE SCHEMES FOR ACTIVE CONTROL OF THE PLANAR FRAME
Optimal locations of the actuators for frame active control are investigated in this article. The aim is to minimize the structural drifts by employing several actuators. By utilizing genetic algorithm, the appropriate locations of the actuators are determined. They should be placed in locations where they can minimize the maximum structural drift. To explore the capability of the proposed tech...
متن کاملA fast and accurate approximation for planar pose graph optimization
This work investigates the pose graph optimization problem, which arises in maximum likelihood approaches to Simultaneous Localization And Mapping (SLAM). State-of-theart approaches have been demonstrated to be very efficient in medium and large-sized scenarios; however, their convergence to the maximum likelihood estimate heavily relies on the quality of the initial guess. We show that, in pla...
متن کاملApproximation Techniques for Stochastic Combinatorial Optimization Problems
The focus of this thesis is on the design and analysis of algorithms for basic problems in Stochastic Optimization, speciVcally a class of fundamental combinatorial optimization problems where there is some form of uncertainty in the input. Since many interesting optimization problems are computationally intractable (NP-Hard), we resort to designing approximation algorithms which provably outpu...
متن کاملApproximation thresholds for combinatorial optimization problems
An NP-hard combinatorial optimization problem Π is said to have an approximation threshold if there is some t such that the optimal value of Π can be approximated in polynomial time within a ratio of t, and it is NP-hard to approximate it within a ratio better than t. We survey some of the known approximation threshold results, and discuss the pattern that emerges from
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2002.2903