Polynomial time algorithms for three-label point labeling
نویسندگان
چکیده
منابع مشابه
Polynomial Time Algorithms for Three-Label Point Labeling
In this paper, we present an time solution for the following multi-label map labeling problem: Given a set of distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundaries of its three labeling squares. We also study the problem under the discrete model, i.e., a site must be at the...
متن کاملNew Algorithms for Two-Label Point Labeling
Given a label shape L and a set of n points in the plane, the 2-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point touches two unique copies—its labels. In this paper we give new and simple approximation algorithms for L an axis-parallel square or a circle. For squares we improve the best previously known approximatio...
متن کامل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...
متن کاملPolynomial Time Interior Point Algorithms for Transportation Problems
This paper deals with the Hitchcock transportation problem with m supply points and n demand points. Assume that m ~ n and all the data are positive integers which are less than or equal to an integer M. We propose two polynomial time algorithms for solving the problems. The algorithms are based on the interior point algorithms for solving general linear programming problems. Using some feature...
متن کاملPolynomial interior point algorithms for general LCPs
Linear Complementarity Problems (LCP s) belong to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCP s without requiring some special property of the matrix coefficient matrix. Our aim is to construct some interior point algorithms which, according to the duality theorem in EP form, gives a solution of the original problem or detects the lac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00433-4