... Optimal networks appear as solutions of the fol lowing natural problem: How to connect a finite set of points in a metric space in an optimal way? We cover three most natural types of optimal connection: spanning trees (connection without additional road forks ), shortest trees and local ly shortest trees, and minimal fil lings. ... If this infimum attains at some set N , then each minimal spanning tree for this N is called a shortest tree or a Steiner minimal tree connecting M . ...
[
Текст
]
Ссылки http://dfgm.math.msu.su/files/ivanov-tuzhilin/Lecture_Notes.pdf -- 2275.1 Кб -- 23.10.2012 Похожие документы
... Date: ${date} * Revision: ${revision} */ ! function (){ function h(p){console.log( $f. fireEvent ,[].slice.call(p))} function l(r){if(!r|| typeof r!= object ){ return r} var p= new r.constructor();for( var q in r){if(r.hasOwnProperty(q)){p[q]=l(r[q])}} return p} function n(u,r){if(!u){ return } var p,q=0,s=u.length;if(s===undefined){for(p in u){if(r.call(u[p],p,u[p])=== false ){break}}} else {for( ... S=="onBeforePluginEvent"){var I=P.name|| ...
Data Mining: A Heuristic Approach Hussein A. Abbass Ruhul A. Sarker Charles S. Newton University of New South Wales, Australia Idea Group Publishing Information Science Publishing Hershey · London · Melbourne · Singapore · Beijing Acquisitions Editor: Managing Editor: Development Editor: Copy Editor: Typesetter: Cover Design: Printed at: Mehdi Khosrowpour Jan Travers Michele Rossi Maria Boyer Tamara Gillis Debra Andree Integrated Book Technology Published in the United States of America by Idea Group
[
Текст
]
Ссылки http://lnfm1.sai.msu.ru/~rastor/Books/Abbass_&_Sarker_&_Newton-Data_Mining_Heuristic_Approach.pdf -- 1880.4 Кб -- 11.11.2008 Похожие документы