An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
Includes bibliographical references.
Other Authors: | Bertsimas, Dimitris |
---|---|
Language: | eng |
Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2263 |
Similar Items
-
A faster strongly polynomial minimum cost flow algorithm
Published: (2003) -
New neighborhood search structures for the capacitated minimum spanning tree problem
Published: (2003) -
A central limit theorem for the exodic tree and exodic matching in geometrical probability
Published: (2003) -
An architectural comparison of contemporary apporaches and products for integrating heterogeneous information systems
Published: (2003) -
Models for planning the evolution of local telecommunication networks
Published: (2003)