Approximation algorithms for free-label maximization
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Free-Label Maximization
Inspired by applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points in the plane and labels that are unit squares, place a label with each point in P in such a way that the number of free labels (labels not intersecting any other label) is maximized. We develop efficient constant-factor approximation algorithms f...
متن کاملAdditive Approximation Algorithms for Modularity Maximization
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph G = (V,E), we are asked to find a partition C of V that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical a...
متن کاملPolynomial Time Algorithms for Label Size Maximization on Rotating Maps
Map labeling is a problem of placing labels at corresponding graphical features on a map. There are two optimization problems: the label number maximization problem and the label size maximization problem. In general, both problems are NP-hard for static maps. Recently, the widespread use of several applications, such as personal mapping systems, has increased the importance of dynamic maps and...
متن کاملImproved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approxim...
متن کاملApproximation Algorithms for Indefinite Complex Quadratic Maximization Problems
In this paper we consider the following two types of complex quadratic maximization problems: (i) maximize zHQz, subject to z k = 1, k = 1, ..., n, where Q is a Hermitian matrix with tr Q = 0 and z ∈ C is the decision vector; (ii) maximize Re yHAz, subject to y k = 1, k = 1, ..., p, and z l = 1, l = 1, ..., q, where A ∈ Cp×q and y ∈ C and z ∈ C are the decision vectors. In the real cases (namel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2012
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2011.10.004