Return to search

A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem

Ravindra K. Ahuja, James B. Orlin. / "(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover. / Includes bibliographical references (p. 20). / Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/2700
Date January 1998
ContributorsAhuja, Ravindra K., 1956-, Orlin, James B., 1953-, Sloan School of Management.
PublisherSloan School of Management, Massachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
Format20 p., 6 p. of plates, 1510662 bytes, application/pdf
RelationWorking paper (Sloan School of Management) ; WP 4006-98.

Page generated in 0.0018 seconds