61 search results - page 8 / 13 » soda 2001 |
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...