Complete Convergence of Short Paths and Karp's Algorithm for the TSP.

Abstract

The main objective of the present note is to solve a problem proposed by Weide (1978) concerning the complete convergence of certain random variables associated with Karp's probabilistic analysis of the traveling salesman problem (Karp (1976), (1977)).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 02, 1980
Accession Number
ADA087901

Entities

People

  • J. Micheal Steele

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Convergence
  • Inequalities
  • Military Research
  • New York
  • Probability
  • Random Variables
  • Security
  • Statistics
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research