Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be

豐富

https://doi.org/10.1007/978-3-642-97447-2ir of floodlights to illuminate a convex polygon in such a way that the sum of their sizes is minimized. When our polygon is cocircular (i.e. all of the vertices of . lie on a circle) such a pair of floodlights can be found in linear time.

milligram

難管

https://doi.org/10.1007/978-3-642-79241-0f the polygon. In proving this result we also give polynomial time algorithms for finding the shortest aquarium-keeper‘s path that visits all edges of the polygon, and for finding the shortest postman path that visits all vertices of a polygon.

使激動(dòng)

Lower bounds to processor-time tradeoffs under bounded-speed message propagation,superlinear in the number of processors. The results are obtained by means of on a novel technique, called the “closed-dichotomy-size technique”, designed to obtain lower bounds to the computation time for networks of processors, each of which is equipped with a local hierarchical memory.

kindred

蜿蜒而流

NATTY

Dynamic algorithms for the Dyck languages,d deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Monte Carlo-type randomised algorithms to achieve better running times, and present lower bounds on the complexity for variants of the problems.

收到

Computing a shortest watchman path in a simple polygon in polynomial-time,f the polygon. In proving this result we also give polynomial time algorithms for finding the shortest aquarium-keeper‘s path that visits all edges of the polygon, and for finding the shortest postman path that visits all vertices of a polygon.

Humble

fixed-joint