A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.61, Iss.5, 2001-05, pp. : 662-666

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

An Algorithm for Partitioning a Set into Simple Parts

By Savel'ev L.

Programming and Computer Software, Vol. 31, Iss. 6, 2005-11 ,pp. : 293-300

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Single machine scheduling with batch set-up times to minimize maximum lateness

By Hariri A.M.A. Potts C.N.

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 75-92

Springer Publishing Company

Access to resources Recommend Favorite

A recursive partitioning algorithm for matrix inversion on parallel computers

By Östermark Ralf

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 27, Iss. 5, 1998-05 ,pp. : 496-510

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Investigation of multiwavelets and set partitioning algorithm on mammogram images

By Ragupathy U.S. Tamilarasi A.

International Journal of Modelling, Identification and Control, Vol. 9, Iss. 3, 2010-04 ,pp. : 311-317

Inderscience Publishers

Access to resources Recommend Favorite

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite