A Delaunay diagram‐based Min–Max CP‐Tree algorithm for Spatial Data Analysis

E-ISSN： 1942-4795|5|3|142-154

ISSN： 1942-4787

Source： WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol.5, Iss.3, 2015-05, pp. : 142-154

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Cycle Time Computing Algorithm and its Application in the Structural Analysis of Min-max Systems

By Cheng Yiping Zheng Da-Zhong

Discrete Event Dynamic Systems, Vol. 14, Iss. 1, 2004-01 ,pp. : 5-30

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for Timing Verification of Systems Constrained by Min–max Inequalities

By Cheng Yiping Zheng Da-Zhong

Discrete Event Dynamic Systems, Vol. 17, Iss. 1, 2007-03 ,pp. : 99-129

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

By Khani M. Salavatipour Mohammad

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 443-460

Springer Publishing Company

Access to resources Recommend Favorite

On Absorbing Cycles in Min–Max Digraphs

By Günzel Harald Jongen Hubertus

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 85-92

Springer Publishing Company

Access to resources Recommend Favorite

A simple and effective algorithm for the MaxMin diversity problem

By Porumbel Daniel Hao Jin-Kao Glover Fred

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 275-293

Springer Publishing Company

Access to resources Recommend Favorite