Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

Thumbnail Image
Download
Name

OR-183-88-20061239.pdf

Size

1.67 MB

Format

Adobe PDF

Checksum (MD5)

1725c1a8863e44bdeeac443548a8dbe3

Date Issued
1988
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 183-88
Description
Includes bibliographical references.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5077
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.