Welcome to the InfoSci Platform
An Optimal Balanced Partitioning of a Set of 1D Intervals

An Optimal Balanced Partitioning of a Set of 1D Intervals

Chuan-Kai Yang
Copyright: © 2010 |Volume: 1 |Issue: 2 |Pages: 8
ISSN: 1947-3087|EISSN: 1947-3079|EISBN13: 9781609604257|DOI: 10.4018/jalr.2010040106
Cite Article Cite Article

MLA

Yang, Chuan-Kai. "An Optimal Balanced Partitioning of a Set of 1D Intervals." IJALR vol.1, no.2 2010: pp.72-79. http://doi.org/10.4018/jalr.2010040106

APA

Yang, C. (2010). An Optimal Balanced Partitioning of a Set of 1D Intervals. International Journal of Artificial Life Research (IJALR), 1(2), 72-79. http://doi.org/10.4018/jalr.2010040106

Chicago

Yang, Chuan-Kai. "An Optimal Balanced Partitioning of a Set of 1D Intervals," International Journal of Artificial Life Research (IJALR) 1, no.2: 72-79. http://doi.org/10.4018/jalr.2010040106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Given a set of 1D intervals and a desired partition number, in this paper, the author examines how to make an optimal partitioning of these intervals, such that the number of intervals between the largest partition and smallest partition is minimal among all possible partitioning schemes. This problem has its difficulty due to the fact that an interval “striding” multiple partitions should be counted multiple times. Previously the author proposed an approximated solution to this problem by employing a simulated annealing approach (Yang & Chiueh, 2006), which could give satisfactory results in most cases; however, there is no theoretical guarantee on its optimality. This paper proposes a method that could both optimally and deterministically partition a given set of 1D intervals into a given number of partitions. The author shows that some load balancing problems could also be formulated as a balanced interval partitioning problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.