Probability and Statistics Applied to the Theory of Algorithms.

Abstract

This report outlines in three sections the progress that has been made in the last two years. Work on the minimal spanning tree problem is first discussed, since this area has seen the most striking progress. The second section discuss work on the convex hulls of random walks. This work is the most recent, and it illustrates the broader applicability of ideas that were developed in the earlier stages of this grant. The third section discusses the thesis work of doctoral candidates Maki Monna and Jun Gao who have been supported in part through this contract.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 30, 1990
Accession Number
ADA239220

Entities

People

  • J. M. Steele

Organizations

  • Princeton University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computer Science
  • Computer Simulations
  • Computers
  • Electronic Components
  • Geometry
  • Heuristic Methods
  • Operations Research
  • Probability
  • Random Walk
  • Sampling
  • Simulations
  • Statistical Samples
  • Statistics
  • Theses
  • Weak Convergence

Readers

  • Graph Algorithms and Convex Optimization.
  • Technical Research and Report Writing.