Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under l-distance

M. T. Ko*, Yu-Tai Ching

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

In this paper, the weighted tailored 2-partition problem and the weighted 2-center problem under l-distance are considered. An O(2d-1·d·n) algorithm to solve the weighted tailored 2-partition problem and an O(d2·n + d2·log*d) time algorithm to solve the weighted 2-center problem in the d-dimensional case are presented.

Original languageEnglish
Pages (from-to)397-410
Number of pages14
JournalDiscrete Applied Mathematics
Volume40
Issue number3
DOIs
StatePublished - 14 Dec 1992

Fingerprint Dive into the research topics of 'Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under l<sub>∞</sub>-distance'. Together they form a unique fingerprint.

  • Cite this