An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2263

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsimas, Dimitris	-
dc.contributor	Van Ryzin, Garrett John.	-
dc.contributor	Sloan School of Management.	-
dc.date	2003-04-29T05:02:26Z	-
dc.date	2003-04-29T05:02:26Z	-
dc.date	1989	-
dc.date.accessioned	2013-05-31T23:56:46Z	-
dc.date.available	2013-05-31T23:56:46Z	-
dc.date.issued	2013-06-01	-
dc.identifier	no. 3058-89-MS	-
dc.identifier	http://hdl.handle.net/1721.1/2263	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	Dimitris J. Bertsimas and Garrett van Ryzin.	-
dc.description	Includes bibliographical references.	-
dc.description	Partially supported by the National Science Foundation. ECS-8717970	-
dc.format	16 p.	-
dc.format	736995 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Alfred P. Sloan School of Management, Massachusetts Institute of Technology	-
dc.relation	Working paper (Sloan School of Management) ; 3058-89.	-
dc.subject	HD28 .M414 no.3058-, 89	-
dc.title	An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI