This is not the document you are looking for? Use the search form below to find more!

Report home > Computer / Internet


0.00 (0 votes)
Document Description
File Details
  • Added: February, 25th 2012
  • Reads: 97
  • Downloads: 1
  • File size: 655.16kb
  • Pages: 17
  • Tags: karp, random, tsp
  • content preview
  • Name: random
Embed Code:

Add New Comment

Related Documents

Block Design Performance in the Williams Syndrome Phenotype: A Problem with Mental Imagery?

by: dania, 10 pages

Williams syndrome (WS) is a rare genetic disorder which, among other characteristics, has a distinctive cognitive profile. Nonverbal abilities are generally poor in relation to verbal abilities, but ...

Content Preview
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the
Author(s): Richard M. Karp
Source: Mathematics of Operations Research, Vol. 2, No. 3 (Aug., 1977), pp. 209-224
Published by: INFORMS
Stable URL:
Accessed: 06/03/2009 16:10
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at JSTOR's Terms and Conditions of Use provides, in part, that unless
you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you
may use content in the JSTOR archive only for your personal, non-commercial use.
Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed
page of such transmission.
JSTOR is a not-for-profit organization founded in 1995 to build trusted digital archives for scholarship. We work with the
scholarly community to preserve their work and the materials they rely upon, and to build a common research platform that
promotes the discovery and use of these resources. For more information about JSTOR, please contact
INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Mathematics of Operations

Document Outline

  • Article Contents
    • p. 209
    • p. 210
    • p. 211
    • p. 212
    • p. 213
    • p. 214
    • p. 215
    • p. 216
    • p. 217
    • p. 218
    • p. 219
    • p. 220
    • p. 221
    • p. 222
    • p. 223
    • p. 224
  • Issue Table of Contents
    • Mathematics of Operations Research, Vol. 2, No. 3 (Aug., 1977), pp. 209-296
      • Front Matter
      • Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane [pp. 209 - 224]
      • Graphs and Cooperation in Games [pp. 225 - 229]
      • A Substitute Inverse for the Basis of a Staircase Structure Linear Program [pp. 230 - 239]
      • An Upper Bound for the Equilibrium Mean Wait in a Stationary GI/G/1 Queue [pp. 240 - 243]
      • Stochastic Orderings from Partially Known Utility Functions [pp. 244 - 252]
      • Unconstrained Optimization by Approximation of the Gradient Path [pp. 253 - 265]
      • Decision Problems with Expected Utility Criteria, II: Stationarity [pp. 266 - 274]
      • Scheduling Equal-Length Tasks under Treelike Precedence Constraints to Minimize Maximum Lateness [pp. 275 - 284]
      • Nonconvex Duality in Multiobjective Optimization [pp. 285 - 291]
      • The Probability That a Random Polytope Is Bounded [pp. 292 - 296]
      • Back Matter




Your download will begin in a moment.
If it doesn't, click here to try again.

Share KARP to:

Insert your wordpress URL:


Share KARP as:



Share KARP.

Enter two words as shown below. If you cannot read the words, click the refresh icon.


Share KARP as:

Copy html code above and paste to your web page.