𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the third annual symposium - Waterloo, Ontario, Canada (1987.06.08-1987.06.10)] Proceedings of the third annual symposium on Computational geometry - SCG '87 - Fast algorithms for computing the largest empty rectangle

✍ Scribed by Aggarwal, A.; Suri, S.

Book ID
121745516
Publisher
ACM Press
Year
1987
Tongue
English
Weight
977 KB
Category
Article
ISBN-13
9780897912310

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the tenth annual symposium -
[ACM Press the tenth annual symposium - Stony Brook, New York, United States (1994.06.06-1994.06.08)] Proceedings of the tenth annual symposium on Computational geometry - SCG '94 - A fast algorithm for constructing sparse Euclidean spanners
✍ Das, Gautam; Narasimhan, Giri πŸ“‚ Article πŸ“… 1994 πŸ› ACM Press βš– 689 KB

Gautam Das q t Giri Narasimhanà bstract Let G = (V, 1?) be a n-vertex connected graph with positive edge weights. A subgraph G' is a t-spanner if for all u, v c V, the distance between u and v in the subgraph is at most t times the corresponding distance in G. We design an O(n log2 n) time algorithm