The Clarkson-Shor technique revisited and extended

Authors:
Micha Sharir
Affiliations:
School of Mathematical Sciences, Tel Aviv University, Tel, Aviv 69978, Israel, and Courant Institute of Mathematical, Sciences, New York University, NewYork, NY
Venue:
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Year:
2001

Citing 5
Cited 1

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Randomized algorithms

Handbook of discrete and computational geometry
Crossing Numbers and Hard Erdös Problems in Discrete Geometry

Combinatorics, Probability and Computing

The resilience of WDM networks to probabilistic geographical failures

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an alternative simpler and more general deriva- tion of the Clarkson-Shor probabilistic technique [4] and use it to obtain in addition several extensions and new combi- natorial bounds.