Random cutting and records in deterministic and random trees

  • Authors:

  • Svante Janson

  • Affiliations:

  • Department of Mathematics, Uppsala University, P.O. Box 480, S-751 06 Uppsala, Sweden

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal traveling salesmen tours, ...