共查询到20条相似文献,搜索用时 15 毫秒
1.
Minimum-Volume Enclosing Ellipsoids and Core Sets 总被引:3,自引:0,他引:3
We study the problem of computing a (1+ε)-approximation to the minimum-volume enclosing ellipsoid of a given point set
. Based on a simple, initial volume approximation method, we propose a modification of the Khachiyan first-order algorithm. Our analysis leads to a slightly improved complexity bound of
operations for
. As a byproduct, our algorithm returns a core set
with the property that the minimum-volume enclosing ellipsoid of
provides a good approximation to that of
. Furthermore, the size of
depends on only the dimension d and ε, but not on the number of points n. In particular, our results imply that
for
.We thank the Associate Editor and an anonymous referee for handling our paper efficiently and for helpful comments and suggestions.This author was supported in part by NSF through Grant CCR-0098172.This author was supported in part by NSF through CAREER Grant DMI-0237415. 相似文献
2.
Consider the problem of computing a (1+?)-approximation to the minimum volume axis-aligned ellipsoid (MVAE) enclosing a set of m points in Rn. We first provide an extension and improvement to algorithm proposed in Kumar and Y?ld?r?m (2008) [5] (the KY algorithm) for the MVAE problem. The main challenge of the MVAE problem is that there is no closed form solution in the line search step (beta). Therefore, the KY algorithm proposed a certain choice of beta that leads to their complexity and core set results in solving the MVAE problem. We further analyze the line search step to derive a new beta, relying on an analysis of up to the fourth order derivative. This choice of beta leads to the improved complexity and core set results. The second modification is given by incorporating “away steps” into the first one at each iteration, which obtains the same complexity and core set results as the first one. In addition, since the second modification uses the idea of “dropping points”, it has the potential to compute smaller core sets in practice. Some numerical results are given to show the efficiency of the modified algorithms. 相似文献
3.
F. Hurtado C. Merino D. Oliveros T. Sakai J. Urrutia I. Ventura 《Graphs and Combinatorics》2009,25(3):327-339
Let R and B be disjoint point sets such that R ∪ B is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P.
In this paper we prove that if the vertices of the convex hull of R ∪ B belong to B, and |R| ≤ |Conv(B)| − 1 then B encloses R. The bound is tight. This improves on results of a previous paper in which it was proved that if |R| ≤ 56 |Conv(B)| then B encloses R. To obtain our result we prove the next result which is interesting on its own right: Let P be a convex polygon with n vertices p
1 , ... , p
n
and S a set of m points contained in the interior of P, m ≤ n − 1. Then there is a convex decomposition {P
1 , ... , P
n
} of P such that all points from S lie on the boundaries of P
1 , ... , P
n
, and each P
i
contains a whole edge of P on its boundary.
F. Hurtado partially supported by projects MEC MTM2006-01267 and DURSI 2005SGR00692. C. Merino supported by CONACYT of Mexico,
Proyecto 43098. J. Urrutia supported by CONACYT of Mexico, Proyecto SEP-2004-Co1-45876, and MCYT BFM2003-04062. I. Ventura
partially supported by Project MCYT BFM2003-04062. 相似文献
4.
Henrion D. Tarbouriech S. Arzelier D. 《Journal of Optimization Theory and Applications》2001,108(1):1-28
This paper surveys various linear matrix inequality relaxation techniques for evaluating the maximum norm vector within the intersection of several ellipsoids. This difficult nonconvex optimization problem arises frequently in robust control synthesis. Two randomized algorithms and several ellipsoidal approximations are described. Guaranteed approximation bounds are derived in order to evaluate the quality of these relaxations. 相似文献
5.
Sang Won Bae Chunseok Lee Hee-Kap Ahn Sunghee Choi Kyung-Yong Chwa 《Computational Geometry》2009,42(9):903-912
We study the problems of computing two non-convex enclosing shapes with the minimum area; the L-shape and the rectilinear convex hull. Given a set of n points in the plane, we find an L-shape enclosing the points or a rectilinear convex hull of the point set with minimum area over all orientations. We show that the minimum enclosing shapes for fixed orientations change combinatorially at most O(n) times while rotating the coordinate system. Based on this, we propose efficient algorithms that compute both shapes with the minimum area over all orientations. The algorithms provide an efficient way of maintaining the set of extremal points, or the staircase, while rotating the coordinate system, and compute both minimum enclosing shapes in O(n2) time and O(n) space. We also show that the time complexity of maintaining the staircase can be improved if we use more space. 相似文献
6.
8.
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial number of variables and constraints, thus being more efficient than the one commonly used in the approximation algorithms for these types of problems. 相似文献
9.
10.
11.
In this paper we present new results on the approximate parallel construction of Huffman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the first parallel algorithm for that problem with the optimal time and work. Combining our approach with the best known parallel sorting algorithms we can construct an almost optimal Huffman tree with optimal time and work. This also leads to the first parallel algorithm that constructs exact Huffman codes with maximum codeword length H in time O(H) with n/logn processors, if the elements are sorted. 相似文献
12.
We consider the problem of finding a large number of disjoint paths for unit disks moving amidst static or dynamic obstacles. The problem is motivated by the capacity estimation problem in air traffic management, in which one must determine how many aircraft can safely move through a domain while avoiding each other and avoiding “no-fly zones” and predicted weather hazards. For the static case we give efficient exact algorithms, based on adapting the “continuous uppermost path” paradigm. As a by-product, we establish a continuous analogue of Menger's Theorem.Next we study the dynamic problem in which the obstacles may move, appear and disappear, and otherwise change with time in a known manner; in addition, the disks are required to enter/exit the domain during prescribed time intervals. Deciding the existence of just one path, even for a 0-radius disk, moving with bounded speed is NP-hard, as shown by Canny and Reif [J. Canny, J.H. Reif, New lower bound techniques for robot motion planning problems, in: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., 1987, pp. 49–60]. Moreover, we observe that determining the existence of a given number of paths is hard even if the obstacles are static, and only the entry/exit time intervals are specified for the disks. This motivates studying “dual” approximations, compromising on the radius of the disks and on the maximum speed of motion.Our main result is a pseudopolynomial-time dual-approximation algorithm. If K unit disks, each moving with speed at most 1, can be routed through an environment, our algorithm finds (at least) K paths for disks of radius somewhat smaller than 1 moving with speed somewhat larger than 1. 相似文献
13.
14.
We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem. There are two objectives of interest: the cycle time and the flow time. We give several approximation algorithms after showing that a very restricted case is APX-hard. 相似文献
15.
This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G=(V,E), and g groups of vertices X1,…,Xg⊆V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find a minimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tight Θ(logg) approximation ratio for this problem when the underlying graph is a tree, and show how this implies an O(logk⋅logg) approximation ratio for general graphs, where . 相似文献
16.
Semidefinite relaxations of certain combinatorial optimization problems lead to approximation algorithms with performance guarantees. For large-scale problems, it may not be computationally feasible to solve the semidefinite relaxations to optimality. In this paper, we investigate the effect on the performance guarantees of an approximate solution to the semidefinite relaxation for MaxCut, Max2Sat, and Max3Sat. We show that it is possible to make simple modifications to the approximate solutions and obtain performance guarantees that depend linearly on the most negative eigenvalue of the approximate solution, the size of the problem, and the duality gap. In every case, we recover the original performance guarantees in the limit as the solution approaches the optimal solution to the semidefinite relaxation. 相似文献
17.
We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility location problem. We show that their algorithm does not close the gap with the lower bound on approximability, 1.463, by providing a construction of instances for which its approximation ratio is not better than 1.494. 相似文献
18.
19.
On the complexity of the k-customer vehicle routing problem 总被引:1,自引:0,他引:1
We investigate the complexity of the k-CUSTOMER VEHICLE ROUTING PROBLEM: Given an edge weighted graph, the problem requires to compute a minimum weight set of cyclic routes such that each contains a distinguished depot vertex and at most other k customer vertices, and every customer belongs to exactly one route. 相似文献
20.
AbstractThe allocation problem of rewards or costs is a central question for individuals and organizations contemplating cooperation under uncertainty. The involvement of uncertainty in cooperative games is motivated by the real world where noise in observation and experimental design, incomplete information and further vagueness in preference structures and decision-making play an important role. The theory of cooperative ellipsoidal games provides a new game theoretical angle and suitable tools for answering this question. In this paper, some solution concepts using ellipsoids, namely the ellipsoidal imputation set, the ellipsoidal dominance core and the ellipsoidal stable sets for cooperative ellipsoidal games, are introduced and studied. The main results contained in the paper are the relations between the ellipsoidal core, the ellipsoidal dominance core and the ellipsoidal stable sets of such a game. 相似文献