25 search results - page 4 / 5 » siamcomp 1998 |
SIAMCOMP
1998
13 years 5 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
SIAMCOMP
1998
13 years 5 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
SIAMCOMP
1998
13 years 5 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...